Minimizing the earliness-tardiness costs on a single machine

Maher Rebai (1) , Imed Kacem (1, 2)

1 LOSI - Laboratoire d'Optimisation des Systèmes Industriels
2 LCOMS - Laboratoire de Conception, Optimisation et Modélisation des Systèmes

This paper deals with the problem of scheduling a given set of independent jobs on a single machine to minimize the sum of early and tardy costs without considering machine idle time. Jobs have distinct due dates and processing times with earliness and tardiness costs. The problem is proved to be NP-hard (K.R. Baker and G.D. Scudder, 1990). A mixed integer programming formulation for the problem is presented and a lower bound is obtained by the linear relaxation. A branch and bound algorithm is developed incorporating this lower bound and an upper bound proposed by George Lie (1997). Finally, computational experiments on problems with up to 25 jobs are discussed.

Keywords: Upper bound; Schedules; Single machine scheduling; Job shop scheduling; Scheduling; Minimization; Processor scheduling

Domains: Operations Research [cs.RO]

Maher Rebai, Imed Kacem. Minimizing the earliness-tardiness costs on a single machine. 2008 International Conference on Service Systems and Service Management (ICSSSM 2008), Jun 2008, Melbourne, Australia. pp.1-5, ⟨10.1109/ICSSSM.2008.4598495⟩. ⟨hal-02497457⟩