A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem - Archive ouverte HAL Access content directly
Journal Articles Journal of Scheduling Year : 2008

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Francis Sourd
  • Function : Author
  • PersonId : 836436
Safia Kedad-Sidhoum

Abstract

This paper addresses the one-machine scheduling problem with earliness-tardiness penalties. We propose a new branch-and-bound algorithm that can solve instances with up to 50 jobs and that can solve problems with even more general non-convex cost functions. The algorithm is based on the combination of a Lagrangean relaxation of resource constraints and new dominance rules.

Dates and versions

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

Identifiers

Cite

Francis Sourd, Safia Kedad-Sidhoum. A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Journal of Scheduling, 2008, 11 (1), pp.49-58. ⟨10.1007/s10951-007-0048-2⟩. ⟨hal-01185214⟩
77 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More