Lower bounds for scheduling on identical parallel machines with heads and tails

Lower bounds for scheduling on identical parallel machines with heads and tails

0.00 Avg rating—0 Votes
Article ID: iaor20043565
Country: Netherlands
Volume: 129
Issue: 1
Start Page Number: 187
End Page Number: 204
Publication Date: Jul 2004
Journal: Annals of Operations Research
Authors: ,
Abstract:

In this paper, we investigate new lower bounds for the P|rj,qj|Cmax scheduling problem. A new bin packing based lower bound, as well as several new lifting procedures are derived for this strongly NP-hard problem. Extensive numerical experiments show that the proposed lower bounds consistently outperform the best existing ones.

Reviews

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