Geodesic
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
RAIRO - Operations Research - Recherche Opérationnelle, Tome 48 (2014) no. 2, pp. 235-254 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

In this paper we consider the problem of scheduling, on a two-machine flowshop, a set of unit-time operations subject to time delays with respect to the makespan. This problem is known to be 𝒩𝒫-hard in the strong sense. We propose an algorithm based on a branch and bound enumeration scheme. This algorithm includes the implementation of new lower and upper bound procedures, and dominance rules. A computer simulation to measure the performance of the algorithm is provided for a wide range of test problems.

DOI : 10.1051/ro/2014004
Classification : 9008
Keywords: branch and bound, dominance rule, flowshop, lower and upper bounds, time delays 
@article{RO_2014__48_2_235_0,
     author = {Moukrim, Aziz and Rebaine, Djamal and Serairi, Mehdi},
     title = {A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {235--254},
     year = {2014},
     publisher = {EDP-Sciences},
     volume = {48},
     number = {2},
     doi = {10.1051/ro/2014004},
     mrnumber = {3264377},
     zbl = {1292.90321},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2014004/}
}
TY  - JOUR
AU  - Moukrim, Aziz
AU  - Rebaine, Djamal
AU  - Serairi, Mehdi
TI  - A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2014
SP  - 235
EP  - 254
VL  - 48
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2014004/
DO  - 10.1051/ro/2014004
LA  - en
ID  - RO_2014__48_2_235_0
ER  - 
%0 Journal Article
%A Moukrim, Aziz
%A Rebaine, Djamal
%A Serairi, Mehdi
%T A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2014
%P 235-254
%V 48
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2014004/
%R 10.1051/ro/2014004
%G en
%F RO_2014__48_2_235_0
Moukrim, Aziz; Rebaine, Djamal; Serairi, Mehdi. A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays. RAIRO - Operations Research - Recherche Opérationnelle, Tome 48 (2014) no. 2, pp. 235-254. doi: 10.1051/ro/2014004

Cité par Sources :