Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 40, Issue 3, Pages 191-200Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0360-8352(01)00017-1
Keywords
job shop scheduling; genetic algorithm; heuristics; production management; combinatorial optimization
Ask authors/readers for more resources
Scheduling for the job shop is very important in both fields of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization methods owing to the high computational complexity (NP-hard). Genetic algorithms (GA) have been proved to be effective for a variety of situations, including scheduling and sequencing. Unfortunately, its efficiency is not satisfactory. In order to make GA more efficient and practical, the knowledge relevant to the problem to be solved is helpful. In this paper, a kind of hybrid heuristic CA is proposed for problem n/m/G/C-max, where the scheduling rules, such as shortest processing time (SPT) and MWKR, are integrated into the process of genetic evolution. In addition, the neighborhood search technique (NST) is adopted as an auxiliary procedure to improve the solution performance. The new algorithm is proved to be effective and efficient by comparing it with some popular methods, i.e. the heuristic of neighborhood search, simulated annealing (SA), and traditional GA. (C) 2001 Elsevier Science Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available