Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem

Authors:
David M. Markowitz;Lawrence M. Wein
Affiliations:
-;-
Venue:
Operations Research
Year:
2001

Citing 0
Cited 8

Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods

Journal of Scheduling
Mean value analysis for polling systems in heavy traffic

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Revenue Management of a Make-to-Stock Queue

Operations Research
Recovering Cyclic Schedules Using Dynamic Produce-Up-To Policies

Operations Research
Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules

Operations Research
Heavy traffic analysis of polling models by mean value analysis

Performance Evaluation
Polling systems with two-phase gated service: Heavy traffic results for the waiting time distribution

Probability in the Engineering and Informational Sciences
Polling systems with periodic server routing in heavy traffic: renewal arrivals

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper examines how setups, due dates, and the mix of standardized and customized products affect the scheduling of a single machine operating in a dynamic and stochastic environment. We restrict ourselves to the class of dynamic cyclic policies, where the machine busy/idle policy and lot-sizing decisions are controlled in a dynamic fashion, but different products must be produced in a fixed sequence. As in earlier work, we conjecture that an averaging principle holds for this queueing system in the heavy traffic limit, and optimize over the class of dynamic cyclic policies. The results allow for a detailed discussion of the interactions between the due-date, setup, and product mix facets of the problem.