By Topic

Lower bounds for earliness-tardiness minimization on a single machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rebai, M. ; ICD-LOSI, Univ. of Technol. of Troyes, Troyes, France ; Kacem, I. ; Adjallah, K.H.

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.

Published in:

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Date of Conference:

6-9 July 2009