Hidri, L.Gharbi, A.Haouari, Mohamed2012-05-312012-05-312008-081094-6136http://hdl.handle.net/10679/187https://doi.org/10.1007/s10951-008-0070-zDue to copyright restrictions, the access to the full text of this article is only available via subscription.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 theclassical 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.enginfo:eu-repo/semantics/restrictedAccessArticle11423925200025845480000210.1007/s10951-008-0070-zSchedulingRelease datesDue datesMakespanFeasibility and adjustment proceduresEnergetic reasoningBranch-and-bound2-s2.0-49549121827