Jinwei Gu
ABSTRACT
A stochastic flexible scheduling problem subject to random breakdowns is studied in this paper, which objective is to minimize the expected value of makespan. We consider a preemptive-resume model of breakdown. The processing times, breakdown intervals and repair times are random variables subjected to independent normal distributions. An expanding method inspired by paper [1] is devised through predicting expected breakdown time of machines. Based on some concepts of quantum evolution, an Improved Quantum Genetic Algorithm (IQGA) is proposed, which is tested on a sampling problem compared with Cooperative Co-evolutionary Genetic Algorithm (CCGA) and Genetic Algorithm (GA). Experiment results show IQGA has better feasibility and effectiveness.
- S.F. Li, Y.L. Zhu. 2005. Flow shop scheduling with stochastic processing times and machine breakdowns, Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems. v 11, n 10, 1425--1429.Google Scholar
- P. Michael, 2002. Scheduling, Theory, Algorithms, and Systems, Beijing, Tsinghua University Press.Google Scholar
- M. A. Potter, K. A. D. Jong. 1994. A cooperative coevolutionary approach to function optimization, The Third Parallel Problem Solving From Nature, 249--257. Google ScholarDigital Library
- K. K. Han, and J. H. Kim. 2002. Quantum-Inspired evolutionary algorithm for a class of combinatorial optimization, IEEE Transactions on Evolutionary Computation, v 6, n 6, 580--593. Google ScholarDigital Library
- D. ALCAIDE, RODRIGUEZ. 2002. An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns, in: European Journal of Operation Research. v 140, n 2, 384--398.Google Scholar
- I.B. Shahid, H.F. Sun, F.P. Zhang, M.W. Amir,. 2006. Scheduling in flexible job shops under machine breakdowns with initial setup times -- A practical application, WSEAS Transactions on Systems, v 5, n 9, 2224--2229.Google Scholar
Index Terms
- An improved quantum genetic algorithm for stochastic flexible scheduling problem with breakdown
Recommendations
An improved quantum genetic algorithm for stochastic job shop problem
GEC '09: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary ComputationThis paper considers the stochastic job shop scheduling problem with the objective of minimizing the expected value of makespan and the processing times of jobs being subject to independent normal distributions. In order to solve this problem, we devise ...
An Improved Adaptive Genetic Algorithm for Job-Shop Scheduling Problem
ICNC '07: Proceedings of the Third International Conference on Natural Computation - Volume 04An adaptive genetic algorithm with some improvement is proposed to solve the job-shop scheduling problem (JSSP) better. The improved adaptive genetic algorithm (IAGA) obtained by applying the improved sigmoid function to adaptive genetic algorithm. And ...
A fast genetic algorithm for the flexible job shop scheduling problem
GECCO Comp '14: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary ComputationThis paper presents a fast genetic algorithm (GA) for solving the flexible job shob scheduling problem (FJSP). The FJSP is an extension of a classical NP-hard job shop scheduling problem. Here, we combine the active schedule constructive crossover (ASCX)...
Comments