15,799 research outputs found
Priority allocation decisions in large scale MTO/MTS multi-product manufacturing systems : Technical report
In this paper, the authors consider a single stage multi-product manufacturing facility producing a large number of end-products for delivery within a service constraint for the customer lead-time. The manufacturing facility is modeled as a multi-product, multi-priority queuing system. In order to reduce inventory costs, an eĀ±cient priority allocation between items consists in producing some items according to a Make-To-Stock (MTS) policy and others according to a Make-To-Order (MTO)policy epending on their features (costs, required lead-time, demand rates). The authors propose a general optimization procedure that gives a near-optimal Ā°ow control (MTO or MTS) to associate with each product and the corresponding near-optimal priority strategy. We illustrate eĀ±ciency of our procedure via several examples and by a numerical analysis. In addition, we show numerically that a small number of priority classes is suĀ±cient to obtain near-optimal performances.Make-to-Stock (MTS); Make-to-Order (MTO); Priority allocation; Scheduling rule; Heterogeneous multi-product queuing system
Priority Auctions and Queue Disciplines that Depend on Processing Time
Lecture on the first SFB/TR 15 meeting, Gummersbach, July, 18 - 20, 2004We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a queue whose length is unobservable. We consider two bidding schemes that differ in the definition of bids (these may reflect either total payments or payments per unit of time) and in the timing of payments (before, or after service). In both schemes, a customer obtains priority over all customers (waiting in the queue or arriving while he is waiting) who make lower bids. Our main results show how the convexity/concavity of the function expressing the costs of delay determines the queue-discipline (i.e., SPT, LPT) arising in a bidding equilibrium
- ā¦