Worst-case analysis of an approximation algorithm for flow-shop scheduling

Authors:
Eugeniusz Nowicki;Czesaw Smutnicki
Affiliations:
Technical University of Wrocaw, Institute of Engineering Cybernetics, ul. Janiszewskiego 11/17, 50-372 Wrocaw, Poland;Technical University of Wrocaw, Institute of Engineering Cybernetics, ul. Janiszewskiego 11/17, 50-372 Wrocaw, Poland
Venue:
Operations Research Letters
Year:
1989

Citing 0
Cited 3

Minimizing makespan in a two-stage system with flowshop and open shop

Computers and Industrial Engineering
A linear time approximation algorithm for permutation flow shop scheduling

Theoretical Computer Science
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A worst-case analysis of an algorithm proposed by Campbell et al. for the m-machine permutation flow-shop problem is presented. The tight worst-case performance ratio [m/2] is found.