Minimizing makespan for scheduling stochastic job shop with random breakdown

Applied Mathematics and Computation

Volumn 218, Issue 24, 2012, Pages 11851-11858

  Lei, De Ming ^a  

^a WUHAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Breakdown; Discrete event driven; Genetic algorithm; Resumable job; Stochastic job shop scheduling

Indexed keywords

BREAKDOWN; COMPUTATIONAL RESULTS; DECODING METHODS; DISCRETE EVENTS; EFFICIENT GENETIC ALGORITHMS; GENETIC OPERATORS; JOB SHOP; MINIMIZING MAKESPAN; NEW SOLUTIONS; ORDER CROSSOVER; PROCESSING TIME; RESUMABLE JOB; STOCHASTIC JOB SHOP SCHEDULING; STOCHASTIC JOB SHOP SCHEDULING PROBLEM; TEST PROBLEM;

GENETIC ALGORITHMS; SCHEDULING; SCHEDULING ALGORITHMS; SIMULATED ANNEALING;

STOCHASTIC SYSTEMS;

EID: 84863780841     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2012.04.091     Document Type: Article

References (28)

1. P.B. Luh, D. Cheng, and L.S. Thakur An effective approach for job shop scheduling with uncertain processing requirements IEEE Trans. Robot. Auto. 15 1999 328 339
2. M. Singer Forecasting policies for scheduling a stochastic due date job shop Int. J. Prod. Res. 38 15 2000 3623 3637
3. D. Golenko-Ginzburg, and A. Gonik Optimal job-shop scheduling with random operations and cost objectives Int. J. Prod. Econ. 76 2002 147 157
4. R. Tavakkoli-Moghaddam, F. Jolai, F. Vaziri, P.K. Ahmed, and A. Azaron A hybrid method for solving stochastic job shop scheduling problem Appl. Math. Comput. 170 2005 185 206
5. D.M. Lei, H.J. Xiong, An efficient evolutionary algorithm for multi-objective stochastic job shop scheduling. In Proceedings of International Conference on Machine Learning and Cybernetics, 2007, 867-872.
6. D.M. Lei, H.J. Xiong, Job shop scheduling with stochastic processing time through genetic algorithm. In Proceedings of International Conference on Machine Learning and Cybernetics. Kunming, China, 2008, p.941-946.
7. J.W. Gu, X.S. Gu, and M.Z. Gu A novel parallel quantum genetic algorithm for stochastic job shop scheduling J. Math. Anal. Appl. 355 2009 63 81
8. J.W. Gu, M.Z. Gu, C.W. Cao, and X.S. Gu A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem Comput. Oper. Res. 37 2010 927 937
9. W. Li, and J.H. Cao Stochastic scheduling on a single machine subject to multiple breakdown according to different probabilities Oper. Res. Lett. 18 1995 81 91
10. N. Kasap, H. Aytug, and A. Paul Minimizing makespan on a single machine subject to random breakdowns Oper. Res. Lett. 34 2006 29 36
11. A. Allahverdi Two-stage production scheduling with separate setup times and stochastic breakdowns J. Oper. Res. Soc. 46 1995 896 904
12. A. Allahverdi Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness Comput. Oper. Res. 23 1996 909 916
13. A. Allahverdi, and J. Mittenthal Two-machine ordered flowshop scheduling under breakdown Math. Comput. Model. 20 1994 9 17
14. A. Allahverdi, and J. Mittenthal Dual criteria scheduling on a two-machine flowshop subject to random breakdowns Int. Trans. Oper. Res. 5 1998 317 324
15. D. Alcaide, A. Rodriguez-Gonzalez, and J. Sicilia An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns Euro. J. Oper. Res. 140 2002 384 398
16. D. Alcaide, A. Rodriguez-Gonzalez, and J. Sicilia A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures Int. J. Flex. Manuf. Syst. 17 2006 201 226
17. M. Gholami, M. Zandieh, and A. Alem-Tabriz Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns Int. J. Adv. Manuf. Technol. 42 2009 189 201
18. X.Q. Cai, L.M. Wang, and X. Zhou Single-machine scheduling to stochastically minimize maximum lateness J. Sched. 10 2007 293 301
19. W. Jang, and C.M. Klein Minimizing the expected number of tardy jobs when processing times are normally distributed Oper. Res. Lett. 30 2002 100 106
20. M. Shaked, and J.G. Shanthikumar Stochastic Orders and their Applications 1994 Associated press
21. R.W. Cheng, M. Gen, and Y. Tsujimura A tutorial survey of job-shop scheduling problems using genetic algorithms:I Representation Comput. Indus. Eng. 30 4 1996 983 997
22. D.M. Lei A genetic algorithm for flexible job shop scheduling with fuzzy processing time Int. J. Prod. Res. 48 2010 2995 3013
23. D.E. Goldberg, and K. Deb A comparative analysis of selection schemes used in genetic algorithms G. Rawlins, Foundations of genetic algorithms 1991 Morgan Kaufmann
24. C. Bierwirth A generalized permutation approach for job shop scheduling with genetic algorithms OR Spect Appl. Local Search 17 1995 87 92
25. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Sci. 220 1983 671 680
26. Z.G. Lian, B. Jiao, and X.S. Gu A similar particle swarm optimization for job-shop scheduling to minimize makespan App. Math. Comput. 183 2006 1008 1017
27. J. Kennedy, R. Eberhart, Particle swarm optimization, in: Proc. IEEE International Conference on Neural Networks, Perth, WA, Australia, 1995, pp. 1942-1948.
28. D.M. Lei A Pareto archive particle swarm optimization for multi-objective job shop scheduling Comput. Indus. Eng. 54 2008 960 971