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

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

0.00 Avg rating0 Votes
Article ID: iaor19921288
Country: Netherlands
Volume: 10
Issue: 8
Start Page Number: 473
End Page Number: 480
Publication Date: Nov 1991
Journal: Operations Research Letters
Authors: ,
Keywords: heuristics
Abstract:

A worst-case analysis of an algorithm proposed by Dannenbring for the m-machine permutation flow-shop problem is presented and the performance ratio of equ1is found.

Reviews

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