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


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… (More)
DOI: 10.1016/j.cor.2006.05.009


3 Figures and Tables