A Heuristic Scheduling Policy for Multi-Item, Multi-Machine Production Systems with Time-Varying, Stochastic Demands

Published Online:https://doi.org/10.1287/mnsc.40.11.1455

An effective scheduling policy known as the Dynamic Cycle Lengths Heuristic was introduced by Leachman and Gascon in 1988 for the multi-item, single-machine production system facing stochastic, time-varying demands. In this article we develop a heuristic scheduling policy for the multi-machine extension of the same problem. We integrate the concepts of the Dynamic Cycle Lengths Heuristic with a nonlinear integer optimization model to obtain an overall scheduling policy that allocates items to machines and schedules production quantities during the next time period. We report promising performance in limited simulation tests of the policy.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.