Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10522989 | Computers & Industrial Engineering | 2005 | 14 Pages |
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|dj=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.
Related Topics
Physical Sciences and Engineering
Engineering
Industrial and Manufacturing Engineering
Authors
Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner,