Lagrangian bounds for just-in-time job-shop scheduling

Philippe Baptiste Marta Flamini Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We study the job-shop scheduling problem with earliness and tardiness penalties. We describe two Lagrangian relaxations of the problem. The first one is based on the relaxation of precedence constraints while the second one is based on the relaxation of machine constraints. We introduce dedicated algorithms to solve the corresponding dual problems. The second one is solved by a simple dynamic programming algorithm while the first one requires the resolution of an NP-hard problem by branch and bound. In both cases, the relaxations allow us to derive lower bounds as well as heuristic solutions. We finally introduce a simple local search algorithm to improve the best solution found. Computational results are reported.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 2:06:55 PM
Last modification on : Thursday, November 22, 2018 - 2:08:15 PM

Links full text




Philippe Baptiste, Marta Flamini, Francis Sourd. Lagrangian bounds for just-in-time job-shop scheduling. Computers and Operations Research, Elsevier, 2008, 35 (3), pp.906-915. ⟨10.1016/j.cor.2006.05.009⟩. ⟨hal-01185207⟩



Record views