Analysis of heuristic algorithm for the flexible flow shop weighted completion time scheduling problem

Analysis of heuristic algorithm for the flexible flow shop weighted completion time scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20081746
Country: China
Volume: 15
Issue: 2
Start Page Number: 139
End Page Number: 144
Publication Date: Apr 2006
Journal: Systems Engineering Theory Methodology Applications
Authors: , , ,
Keywords: heuristics
Abstract:

By using single machine relaxation, we have proved that, even for the flexible flow shop weighted completion time scheduling problem, the heuristic based on weighted shortest processing requirement is also asymptotically optimal in this paper.

Reviews

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