scholarly journals Heuristic methods for job shop scheduling: Active schedule generation algorithm, non-delay schedule generation algorithm and heuristic schedule generation algorithm

2021 ◽  
Vol 1034 (1) ◽  
pp. 012114
Author(s):  
M. Arul Zaini ◽  
Dwi Agustina Kurniawati
2011 ◽  
Vol 55-57 ◽  
pp. 1789-1793
Author(s):  
Xian Zhou Cao ◽  
Zhen He Yang

In this paper, a dual-resource constrained job shop scheduling problem was studied by designing a hybrid genetic algorithm based on Genetic Algorithm (GA) and Simulated Annealing (SA). GA is used to search for a group of better solutions to the problem of minimizing production cost and then SA is applied to searching them for the best one. The combination of GA and SA utilizes the advantages of the two algorithms and overcomes their disadvantages. The operation-based encoding and an active schedule decoding method were employed. This hybrid genetic algorithm reasonably assigns the resources of machines and workers to jobs and achieves optimum on some performance. The results of numerical simulations, which are compared with those of other well-known algorithms, show better performance of the proposed algorithm.


2011 ◽  
Vol 21 (12) ◽  
pp. 3082-3093
Author(s):  
Zhu-Chang XIA ◽  
Fang LIU ◽  
Mao-Guo GONG ◽  
Yu-Tao QI

Sign in / Sign up

Export Citation Format

Share Document