Ordered Flow Shop Problems with no In-Process Waiting: Further Results

Abstract
The ordered flow shop sequencing problem with no in-processing waiting (OFSNW) is considered with respect to mean flow time criterion. It is shown that the sequence in which jobs are arranged according to the shortest processing time rule (SPT) represents an optimal sequence. Additional results for the makespan criterion are also discussed.

This publication has 0 references indexed in Scilit: