Sequencing a hybrid two-stage flowshop with dedicated machines

Abstract

The paper deals with a two-stage hybrid flowshop problem with one machine in the first stage and two different machines in parallel in the second one. The objective of scheduling such a problem is to minimize the makespan. We demonstrate that the problem is NP-complete. We formulate a dynamic program, which is beyond our grasp for problems of more than 15 jobs. We have conducted experimentation to evaluate the time performance the dynamic programming procedure for "small size" problems.