Satisfying due-dates in a job shop with sequence-dependent family set-ups.
Saved in:
| Title: | Satisfying due-dates in a job shop with sequence-dependent family set-ups. |
|---|---|
| Authors: | Taner, Mehmet R., Hodgson, Thom J., King, Russell E., Thoney, Kristin A. |
| Source: | International Journal of Production Research. 11/20/2003, Vol. 41 Issue 17, p4153-4169. 17p. 1 Diagram, 4 Charts, 7 Graphs. |
| Subjects: | Job shops, Sequential scheduling, Production control, Markov processes, Production scheduling |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 11093684 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Satisfying due-dates in a job shop with sequence-dependent family set-ups. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Taner%2C+Mehmet+R%2E%22">Taner, Mehmet R.</searchLink><br /><searchLink fieldCode="AR" term="%22Hodgson%2C+Thom+J%2E%22">Hodgson, Thom J.</searchLink><br /><searchLink fieldCode="AR" term="%22King%2C+Russell+E%2E%22">King, Russell E.</searchLink><br /><searchLink fieldCode="AR" term="%22Thoney%2C+Kristin+A%2E%22">Thoney, Kristin A.</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. 11/20/2003, Vol. 41 Issue 17, p4153-4169. 17p. 1 Diagram, 4 Charts, 7 Graphs. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Job+shops%22">Job shops</searchLink><br /><searchLink fieldCode="DE" term="%22Sequential+scheduling%22">Sequential scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Production+control%22">Production control</searchLink><br /><searchLink fieldCode="DE" term="%22Markov+processes%22">Markov processes</searchLink><br /><searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=11093684 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/0020754031000149167 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 17 StartPage: 4153 Subjects: – SubjectFull: Job shops Type: general – SubjectFull: Sequential scheduling Type: general – SubjectFull: Production control Type: general – SubjectFull: Markov processes Type: general – SubjectFull: Production scheduling Type: general Titles: – TitleFull: Satisfying due-dates in a job shop with sequence-dependent family set-ups. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Taner, Mehmet R. – PersonEntity: Name: NameFull: Hodgson, Thom J. – PersonEntity: Name: NameFull: King, Russell E. – PersonEntity: Name: NameFull: Thoney, Kristin A. IsPartOfRelationships: – BibEntity: Dates: – D: 20 M: 11 Text: 11/20/2003 Type: published Y: 2003 Identifiers: – Type: issn-print Value: 00207543 Numbering: – Type: volume Value: 41 – Type: issue Value: 17 Titles: – TitleFull: International Journal of Production Research Type: main |
| ResultId | 1 |
