Satisfying due-dates in a job shop with sequence-dependent family set-ups
Author
Taner, M. R.
Hodgson, T. J.
King, R. E.
Thoney, K. A.
Date
2003Source Title
International Journal of Production Research
Print ISSN
207543
Electronic ISSN
1366-588X
Publisher
Taylor & Francis
Volume
41
Issue
17
Pages
4153 - 4169
Language
English
Type
ArticleItem Usage Stats
125
views
views
88
downloads
downloads
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.
Keywords
Computational methodsDecision theory
Forecasting
Job analysis
Markov processes
Mathematical models
Problem solving
Dynamic scheduling problem
Job shop scheduling
Markov decision processes
Scheduling