ON AN UNSOLVED PROBLEM IN OPTIMAL SEQUENCING.
Abstract
The sequencing problem considered is that of determining the arrangement of n jobs through M machines, or processing centers, so as to minimize the total processing time; it is assumed that the processing time of each job on each machine is given, that all jobs processed through the M machines in the same prescribed order, and that no passing between machines is allowed. A recently published algorithm for determining an optimal sequence is examined. A counter-example is constructed for which the proposed method fails, showing that the 'general' algorithm does not solve the sequencing problem; the example involves three jobs and three machines. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 27, 1964
- Accession Number
- AD0606176
Entities
People
- William Karush
Organizations
- System Development Corporation