Technical Note—A Scheduling Problem Involving Sequence Dependent Changeover Times

Publisher Website
Google Scholar
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.

This publication has 0 references indexed in Scilit: