Geodesic
A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
Duran Toksarı, M.1
1 Erciyes University, Engineering Faculty, Industrial Engineering Department, Kayseri, Turkey.
RAIRO - Operations Research - Recherche Opérationnelle, Tome 50 (2016) no. 1, pp. 211-219

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

This paper sheds light on minimizing the maximum tardiness with processing and setup times under both learning effect and deterioration. In this paper, all the jobs have processing and setup times under effects of learning and deterioration. By the effects of learning and deterioration, we mean that the processing time of a job is defined by an increasing function of its execution start time and position in the sequence. We provide a branch and bound algorithm to minimize the maximum tardiness under effects of learning and deterioration with setup times. Computational experiments show that the proposed algorithm can solve instances up to 800 jobs in reasonable time.

Reçu le :
Accepté le :
DOI : 10.1051/ro/2015026
Classification : 90B35, 90B36
Keywords: Maximum tardiness problem, learning effect, deterioration effects, setup times

Duran Toksarı, M. 1

1 Erciyes University, Engineering Faculty, Industrial Engineering Department, Kayseri, Turkey. 
@article{RO_2016__50_1_211_0,
     author = {Duran Toksar{\i}, M.},
     title = {A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {211--219},
     publisher = {EDP-Sciences},
     volume = {50},
     number = {1},
     year = {2016},
     doi = {10.1051/ro/2015026},
     mrnumber = {3460672},
     zbl = {1333.90054},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2015026/}
}
TY  - JOUR
AU  - Duran Toksarı, M.
TI  - A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2016
SP  - 211
EP  - 219
VL  - 50
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2015026/
DO  - 10.1051/ro/2015026
LA  - en
ID  - RO_2016__50_1_211_0
ER  - 
%0 Journal Article
%A Duran Toksarı, M.
%T A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2016
%P 211-219
%V 50
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2015026/
%R 10.1051/ro/2015026
%G en
%F RO_2016__50_1_211_0
Duran Toksarı, M. A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times. RAIRO - Operations Research - Recherche Opérationnelle, Tome 50 (2016) no. 1, pp. 211-219. doi: 10.1051/ro/2015026

Cité par Sources :