The two-machine flow-shop problem with weighted late work criterion and common due date

The two-machine flow-shop problem with weighted late work criterion and common due date

0.00 Avg rating0 Votes
Article ID: iaor20062048
Country: Netherlands
Volume: 165
Issue: 2
Start Page Number: 408
End Page Number: 415
Publication Date: Sep 2005
Journal: European Journal of Operational Research
Authors: , ,
Keywords: computational analysis, programming: dynamic
Abstract:

The paper is on the two-machine non-preemptive flow-shop scheduling problem with a total weighted late work criterion and a common due date (F2|di=d|Yw). The late work performance measure estimates the quality of the obtained solution with regard to the duration of late parts of tasks not taking into account the quantity of this delay. We prove the binary NP-hardness of the problem mentioned by showing a transformation from the partition problem to its decision counterpart. Then, a dynamic programming approach of pseudo-polynomial time complexity is formulated.

Reviews

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