An improved heuristic for two-machine flowshop scheduling with an availability constraint

An improved heuristic for two-machine flowshop scheduling with an availability constraint

0.00 Avg rating0 Votes
Article ID: iaor20052160
Country: Netherlands
Volume: 26
Issue: 5
Start Page Number: 223
End Page Number: 229
Publication Date: Jun 2000
Journal: Operations Research Letters
Authors: ,
Keywords: heuristics
Abstract:

In this paper we study the two-machine flowshop scheduling problem with an availability constraint on the first machine. We first show that the worst-case error bound 1/2 of the heuristic provided by Lee is tight. We then develop an improved heuristic with a worst-case error bound of 1/3.

Reviews

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