Solving job shop scheduling problem using genetic algorithm with penalty function
Sun, Liang and Cheng, Xiaochun and Liang, Yanchun (2010) Solving job shop scheduling problem using genetic algorithm with penalty function. International Journal of Intelligent Information Processing, 1 (2). pp. 65-77. ISSN 2093-1964
This is the latest version of this item.
PDF (Solving Job Shop Scheduling Problem Using Genetic Algorithm with Penalty Function)
- Published version (with publisher's formatting)
This paper presents a genetic algorithm with a penalty function for the job shop scheduling problem. In the context of proposed algorithm, a clonal selection based hyper mutation and a life span extended strategy is designed. During the search process, an adaptive penalty function is designed so that the algorithm can search in both feasible and infeasible regions of the solution space. Simulated experiments were conducted on 23 benchmark instances taken from the OR-library. The results show the effectiveness of the proposed algorithm.
|Research Areas:||A. > School of Science and Technology > Computer and Communications Engineering
A. > School of Science and Technology > Computer Science > Artificial Intelligence group
|Notes on copyright:||We acknowledge permission from IJIIP for hosting published work. (5/11)|
|Depositing User:||Dr X Cheng|
|Date Deposited:||26 Apr 2011 16:55|
|Last Modified:||13 Oct 2016 14:22|
Available Versions of this Item
- Solving job shop scheduling problem using genetic algorithm with penalty function. (deposited 26 Apr 2011 16:55) [Currently Displayed]
Actions (login required)