The Two-Stage Flowshop Scheduling Problem with M Machines at each Stage

Publisher Website
Google Scholar
Abstract
In the following article the two-stage flowshop problem with an identical number of machines at the two stages is discussed. A new lower bound calculation for the makespan is introduced, and the performance of a Johnson’s type ordering is evaluated, This method of job sequencing is shown to be superior to random and SPT (shortest processing time first) orderings over a wide variety of problem sizes involving differing numbers of jobs to be processed and machines available at the two stages.

This publication has 2 references indexed in Scilit: