Article ID: | iaor20012332 |
Country: | United Kingdom |
Volume: | 3 |
Issue: | 1 |
Start Page Number: | 21 |
End Page Number: | 49 |
Publication Date: | Jan 2000 |
Journal: | Journal of Scheduling |
Authors: | Webster Scott |
This paper considers the design of adaptable algorithms that aid the planning and control of material flow through a factory, distribution network, or supply chain. The purpose is to add to the discussion of a research area that, due to technological developments, has the potential to significantly impact practice. We present an overview of the literature on this subject and describe two frameworks that support adaptable scheduling algorithms. One framework builds on insights while the other exploits computing power. General approaches for developing each framework are proposed and illustrated.