Dynamic Scheduling of a Multiclass Make-to-Stock Queue
Lawrence M. Wein
Additional contact information
Lawrence M. Wein: Massachusetts Institute of Technology, Cambridge, Massachusetts
Operations Research, 1992, vol. 40, issue 4, 724-735
Abstract:
Motivated by make-to-stock production systems, we consider a scheduling problem for a single server queue that can process a variety of different job classes. After jobs are processed, they enter a finished goods inventory that services customer demand. The scheduling problem is to dynamically decide which job class, if any, to serve next in order to minimize the long-run expected average cost incurred per unit of time, which includes linear costs (which may differ by class) for backordering and holding finished goods inventory. Under the heavy traffic condition that the server must be busy the great majority of the time in order to satisfy customer demand, the scheduling problem is approximated by a dynamic control problem involving Brownian motion. The Brownian control problem is solved, and its solution is interpreted in terms of the queueing system to obtain a scheduling policy. A simulation experiment is performed that demonstrates the policy's effectiveness.
Keywords: inventory/production: multistage stochastic; production/scheduling: sequencing in a stochastic system; queues: Brownian models of scheduling problems (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (43)
Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.4.724 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:40:y:1992:i:4:p:724-735
Access Statistics for this article
More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().