Dynamic Control of a Multiclass Queue with Thin Arrival Streams

Barış Ata ()
Additional contact information
Barış Ata: Kellogg School of Management, Northwestern University, Evanston, Illinois 60208

Operations Research, 2006, vol. 54, issue 5, 876-892

Abstract: As a model of make-to-order production, we consider an admission control problem for a multiclass, single-server queue. The production system serves multiple demand streams, each having a rigid due-date lead time. To meet the due-date constraints, a system manager may reject orders when a backlog of work is judged to be excessive, thereby incurring lost revenues. The system manager strives to minimize long-run average lost revenues by dynamically making admission control and sequencing decisions. Under heavy-traffic conditions the scheduling problem is approximated by a Brownian control problem, which is solved explicitly. Interpreting this solution in the context of the original queueing system, a nested threshold policy is proposed. A simulation experiment is performed to demonstrate the effectiveness of this policy.

Keywords: production/scheduling; make-to-order production systems; queues; dynamic scheduling via heavy-traffic approximations; dynamic programming; admission control in queues (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1060.0308 (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:54:y:2006:i:5:p:876-892

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().