-
作者：Hassin, R
摘要：The problem we treat is defined on a graph where each node is associated with a variable and there are loss functions defined on the arcs, depending on the difference between the corresponding node variables. The objective is to compute values for the node variables so as to minimize the sum of losses. We exploit the relation between this problem and network flows optimization and use it in developing an approximation algorithm for the problem A main application of the problem is the synchroni...
-
作者：Gallego, G; Queyranne, M; SimchiLevi, D
作者单位：University of British Columbia; Northwestern University
摘要：We consider two economic order quantity models where multiple items use a common resource. In the tactical model, the objective is to establish and coordinate order quantities to minimize total inventory ordering and carrying costs without, ever exceeding a capacity constraint on the resource. In the strategic model, the objective is to establish and coordinate order quantities to minimize the average cost which includes in addition to the ordering and inventory costs, a cost proportional to t...
-
作者：DeWolf, D; Smeers, Y
作者单位：Universite Catholique Louvain
摘要：We develop an algorithm to solve the problem of the optimal dimensioning of a fluid (gas or water) transmission network when the topology of the network is known. The pipe diameters must be chosen to minimize the sum of the investment and operating costs. This two stage problem is solved by application of the bundle method for nonsmooth optimization. The validity of the approach is tested on a problem corresponding to a real situation: the optimal design of a reinforcement of the Belgian gas n...
-
作者：Sainfort, F; Deichtmann, JM
作者单位：University of Wisconsin System; University of Wisconsin Madison
摘要：The standard decomposition theorem for additive and multiplicative utility functions (Pollak 1967, Keeney 1974) assumes that the outcome set is a whole product set. In this paper this assumption is relaxed, and the question of whether or not a natural revision of this theorem necessarily holds is investigated. This paper proves that two additional conditions are needed for the decomposition theorem to hold in the context where the outcome set is a subset of a Cartesian product. It is argued th...
-
作者：Serafini, P
摘要：This scheduling model is derived from the real problem of scheduling looms in a textile industry. Jobs may be independently split. over several specified machines, and preemption is allowed. Deadlines are specified for each job, and jobs are assumed to be available. It is shown that minimizing maximum weighted tardiness can be done in polynomial time. The case of uniform machines (as in the considered application) can be modeled as a network flow, and minimization of maximum tardiness can be d...
-
作者：Cooper, RB; Niu, SC; Srinivasan, MM
作者单位：University of Tennessee System; University of Tennessee Knoxville; University of Texas System; University of Texas Dallas
摘要：We consider the classical polling model: queues served in cyclic order with either exhaustive or gated service, each with its own distinct Poisson arrival stream, service-time distribution, and switchover-time (the server's travel time from that queue to the next) distribution. Traditionally, models with zero switchover times (the server travels at infinite speed) and nonzero switchover times have been considered separately because of technical difficulties reflecting the fact that in the latt...
-
作者：Veatch, MH; Wein, LM
作者单位：Massachusetts Institute of Technology (MIT)
摘要：A single machine produces several different classes of items in a make-to-stock mode. We consider the problem of scheduling the machine to regulate finished goods inventory, minimizing holding and backorder, or holding and lost sales costs. Demands are Poisson, service times are exponentially distributed, and there are no delays or costs associated with switching products. A scheduling policy dictates whether the machine is idle or busy and specifies the job class to serve in the latter case. ...
-
作者：Lai, TC
摘要：We present an O(mn) two-group (TG) heuristic for the m-machine, n-job permutation flow-shop scheduling problem. We show that heuristic TG has a worst-case performance ratio of(m + 1)/2. We also establish worst-case bounds for several heuristics proposed in the past.
-
作者：Rege, KM; Sengupta, B
作者单位：NEC Corporation
摘要：In this paper, we study a multiple class discriminatory processor-sharing quene. The quene is assumed to have Poisson input an exponentially distributed service times. In this discipline there are K classes of customers. When there are n(i) customers present i the system of class i(i = 1, ..., K), each member of class j receives a fraction of the server's capacity given by alpha(j)/Sigma(i=1)(K) n(i) alpha(i). Thus, associated with class i customers is a weight alpha(i) which determines the le...
-
作者：Owens, DW; Parnell, GS; Bivins, RL
作者单位：Virginia Commonwealth University
摘要：This study investigated the feasibility and impacts of various U.S. and USSR time-phased strategic force structure reduction alternatives (commonly referred to as drawdowns) under the Strategic Arms Reduction Treaty (START). The study resulted from the Soviet Union's request for a U.S. position on the proposed Soviet drawdown limits. Treaty drawdown limits are time-phased numerical ceilings specified in the treaty, e.g., total weapons must be less than or equal to 8000 by January 1, 1996 and 6...
