Volume 46, Number 2, April-June 2012
|Page(s)||125 - 147|
|Published online||05 July 2012|
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
Universitéde Lorraine, LCOMS, UFR MIM, Ile du
2 École Polytechnique de Tunisie, 2078 La Marsa, Tunisia
Accepted: 17 April 2012
This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances and the obtained results showed that our algorithms are efficient.
Mathematics Subject Classification: 90B35 / 68M20 / 90C57
Key words: Scheduling / weighted tardiness / parallel machines / branch-and-boun
© EDP Sciences, ROADEF, SMAI, 2012
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.