Accession Number : AD0606176

Title :   ON AN UNSOLVED PROBLEM IN OPTIMAL SEQUENCING.

Descriptive Note : Scientific rept.,

Corporate Author : SYSTEM DEVELOPMENT CORP SANTA MONICA CALIF

Personal Author(s) : Karush,William

Report Date : 27 AUG 1964

Pagination or Media Count : 8

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)

Descriptors :   (*SCHEDULING, SEQUENTIAL ANALYSIS), (*SEQUENTIAL ANALYSIS, SCHEDULING), NUMERICAL METHODS AND PROCEDURES, OPERATIONS RESEARCH, OPTIMIZATION

Distribution Statement : APPROVED FOR PUBLIC RELEASE