Two‐stage proportionate flexible flow shop to minimize the makespan

Two‐stage proportionate flexible flow shop to minimize the makespan

0.00 Avg rating0 Votes
Article ID: iaor2013590
Volume: 25
Issue: 1
Start Page Number: 123
End Page Number: 134
Publication Date: Jan 2013
Journal: Journal of Combinatorial Optimization
Authors: ,
Keywords: scheduling
Abstract:

We consider a two‐stage flexible flow shop problem with a single machine at one stage and m identical machines at the other stage, where the processing times of each job at both stages are identical. The objective is to minimize the makespan. We describe some optimality conditions and show that the problem is NP‐hard when m is fixed. Finally, we present an approximation algorithm that has a worst‐case performance ratio of 5 4 equ1 for m=2 and 1 + m 2 + 1 + m 2 m equ2 for m≥3.

Reviews

Required fields are marked *. Your email address will not be published.