Lagrangian bounds for just-in-time job-shop scheduling - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2008

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

Philippe Baptiste
  • Function : Author
Marta Flamini
  • Function : Author
Francis Sourd
  • Function : Author
  • PersonId : 836436

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.

Dates and versions

hal-01185207 , version 1 (19-08-2015)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More