Technical Note—Three-Stage Flow-Shops with Recessive Second Stage

Abstract

Several papers have described special structural properties for which the minimum makespan flow-shop problem can be efficiently solved. We describe a new special case of the 3 × n problem with small second-stage processing times relative to the first and third stages for which Johnson's algorithm gives an optimal schedule.