Energetic Reasoning Revisited: Application to Parallel Machine Scheduling

Journal Article
Hidri, Lotfi . 2008
الوسوم: 
Scheduling, Release dates, Due dates, Makespan, Feasibility, adjustment procedures, Branch-and-bound
المجلة \ الصحيفة: 
Journal of Scheduling
رقم العدد: 
4
رقم الإصدار السنوي: 
11
الصفحات: 
239-252
مستخلص المنشور: 

We consider the problem of minimizing makespan on identical parallel machines subject to release dates and delivery times. We present several new feasibility tests and adjustment techniques that consistently improve the classical energetic reasoning approach. Computational results carried out on a set of hard instances provide strong evidence that the performance of a state-of-the-art exact branch-and-bound algorithm is substantially improved through embedding the proposed enhanced energetic reasoning.