Geodesic
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
RAIRO - Operations Research - Recherche Opérationnelle, Tome 46 (2012) no. 2, pp. 125-147

Voir la notice de l'article provenant de la source Numdam

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.

DOI : 10.1051/ro/2012010
Classification : 90B35, 68M20, 90C57
Keywords: scheduling, weighted tardiness, parallel machines, branch-and-boun 
@article{RO_2012__46_2_125_0,
     author = {Kacem, Imed and Souayah, Nizar and Haouari, Mohamed},
     title = {Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {125--147},
     publisher = {EDP-Sciences},
     volume = {46},
     number = {2},
     year = {2012},
     doi = {10.1051/ro/2012010},
     mrnumber = {2955461},
     zbl = {1248.90049},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2012010/}
}
TY  - JOUR
AU  - Kacem, Imed
AU  - Souayah, Nizar
AU  - Haouari, Mohamed
TI  - Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2012
SP  - 125
EP  - 147
VL  - 46
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2012010/
DO  - 10.1051/ro/2012010
LA  - en
ID  - RO_2012__46_2_125_0
ER  - 
%0 Journal Article
%A Kacem, Imed
%A Souayah, Nizar
%A Haouari, Mohamed
%T Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2012
%P 125-147
%V 46
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2012010/
%R 10.1051/ro/2012010
%G en
%F RO_2012__46_2_125_0
Kacem, Imed; Souayah, Nizar; Haouari, Mohamed. Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions. RAIRO - Operations Research - Recherche Opérationnelle, Tome 46 (2012) no. 2, pp. 125-147. doi: 10.1051/ro/2012010

Cité par Sources :