 Framework for the dynamic scheduling of complex job shopsEsther Alvarez and Fernando Diaz International Journal of Manufacturing Technology and Management, 2007, vol. 11, issue 3/4, 411-425 Abstract: This paper discusses a Dynamic Scheduling (DS) problem in discrete manufacturing with a combined make-to-stock and make-to-order medium batch high range of products. Most of the available methodologies regarding production scheduling are either off-line methods or propose a whole rescheduling process in order to respond to disturbances. Nevertheless, static assumptions related to the manufacturing environment or customer orders seldom hold good in industrial manufacturing environments. In practice, it is very time-consuming to build new schedules to deal with these problems, so the use of approximate approaches is justified. On the one hand, Heuristic Rules (HRs) can provide good solutions to complex problems in real-time. On the other hand, Genetic Algorithms (GAs) can adapt to the time available to find a solution. In this paper, a comparison is made between HRs and GAs based on the results gathered from a prototype built in the context of a European project under the Growth programme. Keywords: shopfloor control; genetic algorithms; GAs; unexpected events; dynamic scheduling; make-to-stock; make-to-order; job shop scheduling. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmtma:v:11:y:2007:i:3/4:p:411-425 Access Statistics for this article More articles in International Journal of Manufacturing Technology and Management from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.