Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date

Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date

0.00 Avg rating0 Votes
Article ID: iaor2009237
Country: United Kingdom
Volume: 35
Issue: 2
Start Page Number: 574
End Page Number: 599
Publication Date: Feb 2008
Journal: Computers and Operations Research
Authors: , , ,
Keywords: heuristics: tabu search, optimization: simulated annealing, heuristics
Abstract:

In this paper, metaheuristic approaches for the two-machine flow-shop problem with a common due date and the weighted late work performance measure (F2|dj = d|Yw) are presented. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, not taking into account the quantity of the delay for the fully late activities. Since the problem mentioned is known to be NP-hard, three trajectory methods, namely simulated annealing, tabu search and variable neighborhood search are proposed based on the special features of the case under consideration.

Reviews

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