The one machine scheduling with earliness and tardiness penalties

Abstract : We address the one-machine problem in which the jobs have distinct due dates, earliness costs, and tardiness costs. In order to determine the minimal cost of such a problem, a new lower bound is proposed. It is based on the decomposition of each job in unary operations that are then assigned to the time slots, which gives a preemptive schedule. Assignment costs are defined so that the minimum assignment cost is a valid lower bound. A branch-and-bound algorithm based on this lower bound and on some new dominance rules is experimentally tested.
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Lip6 Publications <>
Submitted on : Friday, August 21, 2015 - 3:02:45 PM
Last modification on : Thursday, March 21, 2019 - 2:54:26 PM

Links full text



Francis Sourd, Safia Kedad-Sidhoum. The one machine scheduling with earliness and tardiness penalties. Journal of Scheduling, Springer Verlag, 2003, 6 (6), pp.533-549. ⟨10.1023/A:1026224610295⟩. ⟨hal-01185780⟩



Record views