A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint

International Journal of Production Economics

Volumn 161, Issue , 2015, Pages 74-82

  Wang, Xiuli ^a   Cheng, T C E ^b  

^a NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Heuristic; Identical parallel machines; Scheduling; Worst case ratio bound

Indexed keywords

SCHEDULING;

HEURISTIC; IDENTICAL PARALLEL MACHINES; MACHINE AVAILABILITY; ONE-MACHINE; SCHEDULING JOBS; TIME INTERVAL; WORST-CASE RATIO BOUND;

JOB SHOP SCHEDULING;

EID: 84921823844     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2014.12.001     Document Type: Article

References (20)

1. A. Bar-Noy, S. Guha, J. Naor (Seffi), and B. Schieber Approximating the throughput of multiple machines in real-time scheduling SIAM J. Comput. 31 2001 331 352
2. J.C. Ho, and Y.-L. Chang Minimizing the number of tardy jobs for m parallel machines Eur. J. Oper. Res. 84 1995 343 355
3. H.-C. Hwang, and S.Y. Chang Parallel machine scheduling with machine shutdowns Comput. Math. Appl. 36 1998 21 31
4. H.-C. Hwang, K. Lee, and S.Y. Chang The effect of machine availability on the worst-case performance of LPT Discret. Appl. Math. 148 2005 49 61
5. C. Koulamas, and G.J. Kyparisis A heuristic for maximizing the number of on-time jobs on two uniform parallel machines Nav. Res. Logist. 53 2006 568 575
6. C.-Y. Lee Machine scheduling with an availability constraints J. Glob. Optim. 9 1996 363 382
7. C.-Y. Lee, and S.D. Liman Capacitated two-parallel machines scheduling to minimize sum of job completion times Discret. Appl. Math. 41 1993 211 222
8. J.Y-T. Leung Improved competitive algorithms for two-processor real-time systems Int. J. Found. Comput. Sci. 15 2004 733 751
9. J.Y-T. Leung, and K.M. Yu Heuristic for minimizing the number of late jobs on two processors Int. J. Found. Comput. Sci. 5 1994 261 279
10. C.-J. Liao, C.-W. Chao, and C.-H. Lin Minimizing the sum of job completion times on capacitated two-parallel machines Eur. J. Oper. Res. 197 2009 475 481
11. Y. Ma, C.-B. Chu, and C.R. Zuo A survey of scheduling with deterministic machine availability constraints Comput. Ind. Eng. 58 2010 199 211
12. R. M'Hallah, and R.L. Bulfin Minimizing the weighted number of tardy jobs on parallel processors Eur. J. Oper. Res. 160 2005 471 484
13. C. Oʇuz, F.S. Salman, and Z.B. Yalcin Order acceptance and scheduling decisions in make-to-order systems Int. J. Prod. Econ. 125 2010 200 211
14. E. Sanlaville, and G. Schmidt Machine scheduling with availability constraints Acta Inf. 35 1998 795 811
15. G. Schmidt Scheduling with limited availability Eur. J. Oper. Res. 121 2000 1 15
16. S.A. Slotnick Order acceptance and scheduling: a taxonomy and review Eur. J. Oper. Res. 212 2011 1 11
17. Z.Y. Tan, Y. Chen, and A. Zhang Parallel machines scheduling with machine maintenance for minsum criteria Eur. J. Oper. Res. 212 2011 287 292
18. X.L. Wang, X.Z. Xie, and T.C.E. Cheng A modified artificial bee colony algorithm for order acceptance in two-machine flow shops Int. J. Prod. Econ. 141 2013 14 23
19. X.L. Wang, X.Z. Xie, and T.C.E. Cheng Order acceptance and scheduling in a two-machine flowshop Int. J. Prod. Econ. 141 2013 366 376
20. C.L. Zhao, M. Ji, and H.Y. Tang Parallel-machine scheduling with an availability constraint Comput. Ind. Eng. 61 2011 778 781