Technical Note—A Scheduling Problem Involving Sequence Dependent Changeover Times

A. G. Lockett and A. P. Muhlemann
Additional contact information
A. G. Lockett: University of Manchester, Manchester, United Kingdom
A. P. Muhlemann: University of Manchester, Manchester, United Kingdom

Operations Research, 1972, vol. 20, issue 4, 895-902

Abstract: This note discusses a problem of scheduling jobs on a machine using various machine tools in which considerable changing of the tools is necessary, and the changeover time depends critically on the previous jobs. It derives a branch-and-bound algorithm, which has been shown to be computationally restrictive at the present time. Various heuristic methods have been tried and the computational results are very promising.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.4.895 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:20:y:1972:i:4:p:895-902

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().