Voir la notice de l'article provenant de la source Numdam
This note is concerned with the bicriteria scheduling problem on a series-batching machine to minimize maximum cost and makespan. An O(n5) algorithm has been established previously. Here is an improved algorithm which solves the problem in O(n3) time.
@article{RO_2013__47_1_1_0,
author = {He, Cheng and Wang, Xiumei and Lin, Yixun and Mu, Yundong},
title = {An {Improved} {Algorithm} for a {Bicriteria} {Batching} {Scheduling} {Problem}},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {1--8},
publisher = {EDP-Sciences},
volume = {47},
number = {1},
year = {2013},
doi = {10.1051/ro/2012023},
mrnumber = {3031096},
zbl = {1271.90033},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2012023/}
}
TY - JOUR AU - He, Cheng AU - Wang, Xiumei AU - Lin, Yixun AU - Mu, Yundong TI - An Improved Algorithm for a Bicriteria Batching Scheduling Problem JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2013 SP - 1 EP - 8 VL - 47 IS - 1 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro/2012023/ DO - 10.1051/ro/2012023 LA - en ID - RO_2013__47_1_1_0 ER -
%0 Journal Article %A He, Cheng %A Wang, Xiumei %A Lin, Yixun %A Mu, Yundong %T An Improved Algorithm for a Bicriteria Batching Scheduling Problem %J RAIRO - Operations Research - Recherche Opérationnelle %D 2013 %P 1-8 %V 47 %N 1 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro/2012023/ %R 10.1051/ro/2012023 %G en %F RO_2013__47_1_1_0
He, Cheng; Wang, Xiumei; Lin, Yixun; Mu, Yundong. An Improved Algorithm for a Bicriteria Batching Scheduling Problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 1, pp. 1-8. doi: 10.1051/ro/2012023
Cité par Sources :