The one machine scheduling with earliness and tardiness penalties - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Scheduling Année : 2003

The one machine scheduling with earliness and tardiness penalties

Résumé

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.

Dates et versions

hal-01185780 , version 1 (21-08-2015)

Identifiants

Citer

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

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More