Dynamic Control of a Multiclass Queue with Thin Arrival Streams

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 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 original queueing system, a nested threshold policy is proposed. A simulation experiment is performed to demonstrate the effectiveness of this policy.