An Improved Algorithm for a Bicriteria Batching Scheduling Problem
RAIRO - Operations Research - Recherche Opérationnelle, Volume 47 (2013) no. 1, pp. 1-8.

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.

DOI: 10.1051/ro/2012023
Classification: 68Q25, 90B35, 90B50
Keywords: multicriteria scheduling, batching machine, maximum cost, pareto optimal solutions
@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://archive.numdam.org/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://archive.numdam.org/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://archive.numdam.org/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, Volume 47 (2013) no. 1, pp. 1-8. doi : 10.1051/ro/2012023. http://archive.numdam.org/articles/10.1051/ro/2012023/

[1] S. Albers and P. Brucker, The complexity of one-machine batching problems. Discrete Appl. Math. 47 (1993) 87-107. | MR | Zbl

[2] P. Brucker, Scheduling Algorithms (third edition). Springer, Berlin (2001). | MR | Zbl

[3] R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling : A survey. Annal. Discr. Math. 5 (1979) 287-326. | MR | Zbl

[4] C. He, H. Lin, Y.X. Lin and J. Tian, Bicriteria scheduling on a series -batching machine to minimize maximum cost and makespan. CEJOR Cent. Eur. J. Oper. Res. 21 (2013) 177-186. | MR

[5] C. He, Y.X. Lin and J.J. Yuan, Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine. Found. Comput. Decision Sci. 33 (2008) 369-376. | MR | Zbl

[6] C. He, Y.X. Lin and J.J. Yuan, A DP algorighm for minimizing makespan and total completion time on a series-batching machine. Informat. Process. Lett. 109 (2009) 603-607. | MR | Zbl

[7] H. Hoogeveen, Multicriteria scheduling. European J. Oper. Res. 167 (2005) 592-623. | MR | Zbl

[8] J.A. Hoogeveen, Single-machine scheduling to minimize a function of two or three maximum cost criteria. J. Algorithms 21 (1996) 415-433. | MR | Zbl

[9] S. Webster and K.R. Baker, Scheduling groups of jobs on a single machine. Oper. Res. 43 (1995) 692-703. | MR | Zbl

Cited by Sources: