-
作者：FLAM, SD; BENISRAEL, A
作者单位：Rutgers University System; Rutgers University New Brunswick
摘要：We provide an algorithm for computing Cournot-Nash equilibria in a market that involves finitely many producers. The algorithm amounts to following a certain dynamical system all the way to its steady state, which happens to be a noncooperative equilibrium. The dynamics arise quite naturally as follows. Let each producer continuously adjust the planned production, if desired, as a response to the current aggregate supply. In doing so, the producer is completely guided by myopic profit consider...
-
作者：HARRISON, JM; WEIN, LM
作者单位：Massachusetts Institute of Technology (MIT)
摘要：We consider a multiclass closed queueing network with two single-server stations. Each class requires service at a particular station, and customers change class after service according to specified probabilities. There is a general service time distribution for each class. The problem is to schedule the two servers to maximize the long-run average throughout of the network. By assuming a large customer population and nearly balanced loading of the two stations, the scheduling problem can be a...
-
作者：WEIN, LM
摘要：Motivated by a factory scheduling problem, we consider the problem of input control, subject to a specified product mix, and priority sequencing in a two-station multiclass queueing network with general service time distributions and a general routing structure. The objective is to minimize the long-run expected average number of customers in the system subject to a constraint on the long-run expected average output rate. Under balanced heavy loading conditions, this scheduling problem is appr...
-
作者：ANDERSON, EJ
摘要：In this paper, we consider a version of the Economic Lot Scheduling Problem in which there are no costs specified. The usual form of this problem seeks a pattern of production that minimizes the sum of holding the setup costs. We investigate the problem of finding a feasible schedule which avoids a stockout given the initial stocks of the products being manufactured. It is shown that this problem is NP-hard, and an effective heuristic method for its solution is proposed. This heuristic method ...
-
作者：FLYNN, J; GARSTKA, S
作者单位：Yale University
摘要：Consider a single-item, periodic review, stationary inventory model with stochastic demands, proportional ordering costs, and convex holding and shortage costs, where shortages are backordered and Veinott's well known terminal condition holds. Orders can be scheduled for any period, but the actual inventory level is determined every T periods through an audit. This leads to a dynamic programming model where stage n contains periods (n - 1)T + 1 through nT. For both discounted and averaging cri...
-
作者：DASKIN, M; JONES, PC; LOWE, TJ
作者单位：University of Iowa
摘要：Substantial simplification of existing processes and designs may be required before the potential benefits of modern manufacturing technology can be realized. This paper analyzes implementation problems associated with a flexible system that produces flat sheet-metal parts with interior holes. The paper makes three main contributions. First, we formulate the problem of selecting tooling and design standards as an optimization model and demonstrate that the model yields insight by applying it t...
-
作者：SCHNEIDER, H; TANG, K; OCINNEIDE, C
作者单位：University of Arkansas System; University of Arkansas Fayetteville
摘要：A production process exhibits a decreasing pattern in the process mean in the course of production. We address the decision problem of selecting the starting level of the process mean and the level at which the process mean should be adjusted back to the starting level. The costs to be minimized are the long-run average cost of production, adjustment and loss for defective items. In addition to the optimal solution, simple approximate solutions are developed and shown to be more cost effective...
-
作者：LEE, HS; POLLOCK, SM
作者单位：University of Michigan System; University of Michigan
摘要：An arbitrary configuration of an open queueing network with exponential service times and finite buffers is analyzed. We offer an iterative procedure for approximating the marginal occupancy probabilities for each queue of the system. The method decomposes the queueing network into individual queues and analyzes each in isolation using information from only its nearest neighbors. Based upon the SIMP approximation previously used for tandem queues, it replaces each server's service time with a ...
-
作者：EWACHA, K; RIVAL, I; STEINER, G
作者单位：McMaster University
摘要：We show that permutation schedules are always optimal for regular, symmetric measures of performance for the m-machine flow shop with precedence constraints provided that processing times are identical for noncomparable jobs.
-
作者：KIRKWOOD, CW
