Satisfying due-dates in a job shop with sequence-dependent family set-ups
dc.citation.epage | 4169 | en_US |
dc.citation.issueNumber | 17 | en_US |
dc.citation.spage | 4153 | en_US |
dc.citation.volumeNumber | 41 | en_US |
dc.contributor.author | Taner, M. R. | en_US |
dc.contributor.author | Hodgson, T. J. | en_US |
dc.contributor.author | King, R. E. | en_US |
dc.contributor.author | Thoney, K. A. | en_US |
dc.date.accessioned | 2016-02-08T10:28:50Z | |
dc.date.available | 2016-02-08T10:28:50Z | |
dc.date.issued | 2003 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.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. | en_US |
dc.identifier.doi | 10.1080/0020754031000149167 | en_US |
dc.identifier.eissn | 1366-588X | |
dc.identifier.issn | 207543 | |
dc.identifier.uri | http://hdl.handle.net/11693/24400 | |
dc.language.iso | English | en_US |
dc.publisher | Taylor & Francis | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1080/0020754031000149167 | en_US |
dc.source.title | International Journal of Production Research | en_US |
dc.subject | Computational methods | en_US |
dc.subject | Decision theory | en_US |
dc.subject | Forecasting | en_US |
dc.subject | Job analysis | en_US |
dc.subject | Markov processes | en_US |
dc.subject | Mathematical models | en_US |
dc.subject | Problem solving | en_US |
dc.subject | Dynamic scheduling problem | en_US |
dc.subject | Job shop scheduling | en_US |
dc.subject | Markov decision processes | en_US |
dc.subject | Scheduling | en_US |
dc.title | Satisfying due-dates in a job shop with sequence-dependent family set-ups | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Satisfying due-dates in a job shop with sequence-dependent family set-ups.pdf
- Size:
- 395.01 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version