A comparison of solution procedures for two-machine flow shop scheduling with late work criterion

A comparison of solution procedures for two-machine flow shop scheduling with late work criterion

0.00 Avg rating0 Votes
Article ID: iaor20061240
Country: United Kingdom
Volume: 49
Issue: 4
Start Page Number: 611
End Page Number: 624
Publication Date: Dec 2005
Journal: Computers & Industrial Engineering
Authors: , , ,
Keywords: programming: dynamic
Abstract:

In this paper we analyze different solution procedures for the two-machine flow shop scheduling problem with a common due date and weighted late work criterion, i.e. for problem F2|d1=d|Yw, which is known to be binary NP-hard. In computational experiments we compare the practical efficiency of a dynamic programming approach, an enumerative method and a heuristic list scheduling procedure. Test results show that each solution method has its advantages and none of them can be rejected from consideration a priori.

Reviews

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