|
|
||||||||

Ata
Kellogg School of Management, Northwestern University, Evanston, Illinois 60208
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.
b-ata{at}kellogg.northwestern.edu
Subject classifications: production/scheduling; make-to-order production systems; queues; dynamic scheduling via heavy-traffic approximations; dynamic programming; admission control in queues.
History: Received June 2004;
revision received February 2005;
accepted October 2005.
This article has been cited by other articles:
![]() |
M. Rubino and B. Ata Dynamic Control of a Make-to-Order, Parallel-Server System with Cancellations Operations Research, January 1, 2009; 57(1): 94 - 108. [Abstract] [PDF] |
||||
![]() |
S. Celik and C. Maglaras Dynamic Pricing and Lead-Time Quotation for a Multiclass Make-to-Order Queue Management Science, June 1, 2008; 54(6): 1132 - 1146. [Abstract] [PDF] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |