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

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

0.00 Avg rating0 Votes
Article ID: iaor1989505
Country: Netherlands
Volume: 8
Issue: 3
Start Page Number: 171
End Page Number: 177
Publication Date: Jun 1989
Journal: Operations Research Letters
Authors: ,
Keywords: computational analysis
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.

Reviews

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