Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails

    loading  Checking for direct PDF access through Ovid


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 𝒩𝒫-hard problem. Extensive numerical experiments show that the proposed lower bounds consistently outperform the best existing ones.

Related Topics

    loading  Loading Related Articles