Lower bounds for earliness-tardiness minimization on a single machine - Université de technologie de Troyes Access content directly
Conference Papers Year : 2009

Lower bounds for earliness-tardiness minimization on a single machine

Abstract

In this paper, we propose tow lower bounds for the problem of scheduling N-independent jobs on a single machine to minimize the sum of early and tardy costs. Jobs have distinct due dates and processing times with earliness and tardiness costs. The problem is proved to be NP-hard. A simple local search algorithm is presented in order to derive an upper bound for the problem and tested the proposed lower bounds in a branch and bound algorithm. Computational experiments show that in several cases, where the lower bounds of the literature are weak, our lower bounds are more efficient.
No file

Dates and versions

hal-02496043 , version 1 (02-03-2020)

Identifiers

Cite

Maher Rebai, Imed Kacem, Kondo Adjallah. Lower bounds for earliness-tardiness minimization on a single machine. Industrial Engineering (CIE39), Jul 2009, Troyes, France. pp.23-27, ⟨10.1109/ICCIE.2009.5223868⟩. ⟨hal-02496043⟩
21 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More