Earliness-tardiness scheduling with setup considerations

Francis Sourd (1)

1 RO - Recherche Opérationnelle

The one-machine scheduling problem with sequence-dependent setup times and costs and earliness–tardiness penalties is addressed. A time-indexed formulation of the problem is presented as well as different relaxations that give lower bounds of the problem. Then, a branch-and-bound procedure based on one of these lower bounds is presented. The efficiency of this algorithm also relies on new dominance rules and on a heuristic to derive good feasible schedules. Computational tests are finally presented.

Domaines: Informatique [cs]

Francis Sourd. Earliness-tardiness scheduling with setup considerations. Computers and Operations Research, 2005, 32 (7), pp.1849-1865. ⟨10.1016/j.cor.2003.12.002⟩. ⟨hal-01185226⟩