Lower bounds for the earliness–tardiness scheduling problem on parallel machines with distinct due dates |
| |
Authors: | Safia Kedad-Sidhoum Yasmin Rios SolisFrancis Sourd |
| |
Institution: | Laboratoire LIP6 4, place Jussieu, 75 252 Paris Cedex 05, France |
| |
Abstract: | This paper addresses the parallel machine scheduling problem in which the jobs have distinct due dates with earliness and tardiness costs. New lower bounds are proposed for the problem, they can be classed into two families. First, two assignment-based lower bounds for the one-machine problem are generalized for the parallel machine case. Second, a time-indexed formulation of the problem is investigated in order to derive efficient lower bounds throught column generation or Lagrangean relaxation. A simple local search algorithm is also presented in order to derive an upper bound. Computational experiments compare these bounds for both the one machine and parallel machine problems and show that the gap between upper and lower bounds is about 1.5%. |
| |
Keywords: | Parallel machine scheduling Earliness&ndash tardiness Just-in-time Lower bounds IP time-indexed formulation |
本文献已被 ScienceDirect 等数据库收录! |