Satisfying due-dates in a job shop with sequence-dependent family set-ups
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol.41, no.17, pp.4153-4169, 2003 (SCI-Expanded, Scopus)
- Publication Type: Article / Article
- Volume: 41 Issue: 17
- Publication Date: 2003
- Doi Number: 10.1080/0020754031000149167
- Journal Name: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Page Numbers: pp.4153-4169
- Open Archive Collection: AVESIS Open Access Collection
- TED University Affiliated: No
Abstract
This paper addresses job shop scheduling with sequence dependent family set-ups. Based on a simple, single-machine dynamic scheduling problem, state dependent scheduling rules for the single machine problem are developed and tested using Markov Decision Processes. Then, a generalized scheduling policy for the job shop problem is established based on a characterization of the optimal policy. The policy is combined with a 'forecasting' mechanism to utilize global shop floor information for local dispatching decisions. Computational results show that performance is significantly better than that of existing alternative policies.