Rollout Algorithms for Stochastic Scheduling Problems
Journal of Heuristics
Stochastic Machine Scheduling with Precedence Constraints
SIAM Journal on Computing
Hi-index | 0.00 |
This 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 Quantum Genetic Algorithm (IQGA) and develop a stochastic expected value model. Different from traditional genetic algorithms, IQGA employs the idea of quantum theory, devises a converting mechanism of quantum representation aiming at job shop code, and proposes a new rotation angle table as the update mechanism of populatio. In addition, three crossover operators and three mutation operators are compared in order to obtain the best combination to improve algorithm performance. Compared with standard Genetic Algorithm (GA), experimental results achieved by IQGA demonstrate its feasibility and effectiveness while dealing with the stochastic job shop problem.