Two-stage proportionate flexible flow shop to minimize the makespan

Authors:
Byung-Cheon Choi;Kangbok Lee
Affiliations:
Department of Business Administration, Chungnam National University, Daejeon, Korea 305-704;Department of Supply Chain Management & Marketing Sciences, Rutgers Business School, The State University of New Jersey, Newark, USA 07102
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 7
Cited 0

Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

Theoretical Computer Science
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm

Expert Systems with Applications: An International Journal
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
Minimizing makespan in hybrid flowshops

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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 $\frac{5}{4}$ for m=2 and $\frac{\sqrt{1+m^{2}}+1+m}{2m}$ for m驴3.