Memetic algorithms for solving job-shop scheduling problems

被引：0
|
作者：
Hasan S.M.K. [1 ]
Sarker R. [1 ]
Essam D. [1 ]
Cornforth D. [1 ]
机构：
[1] School of Information Technology and Electrical Engineering, University of New South Wales, Australian Defence Force Academy, Canberra, ACT 2600, Nortchcott Drive
来源：
Memetic Computing | 2009年 / 1卷 / 1期
关键词：
Genetic algorithm; Job-shop scheduling; Local search; Memetic algorithm; Priority rules;
D O I：
10.1007/s12293-008-0004-5
中图分类号：
学科分类号：
摘要：
The job-shop scheduling problem is well known for its complexity as an NP-hard problem. We have considered JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints. In this paper, we developed a memetic algorithm (MA) for solving JSSPs. Three priority rules were designed, namely partial re-ordering, gap reduction and restricted swapping, and used as local search techniques in our MA. We have solved 40 benchmark problems and compared the results obtained with a number of established algorithms in the literature. The experimental results show that MA, as compared to GA, not only improves the quality of solutions but also reduces the overall computational time. © 2008 Springer-Verlag.
引用
收藏
页码：69 / 83
页数：14
相关论文
共 50 条
  • [1] A Memetic Algorithm for Solving Flexible Job-shop Scheduling Problems
    Ma, Wenping
    Zuo, Yi
    Zeng, Jiulin
    Liang, Shuang
    Jiao, Licheng
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 66 - 73
  • [2] Solving job-shop scheduling problems by means of genetic algorithms
    Varela, Ramiro
    Vela, Camino R.
    Puente, Jorge
    Gomez, Alberto
    Vidal, Ana M.
    The Practical Handbook of Genetic Algorithms: Applications, Second Edition, 2000, : 275 - 294
  • [3] Adaptive Genetic Algorithms for The Job-Shop Scheduling Problems
    Yang, Gui
    Lu, Yujun
    Li, Ren-wang
    Han, Jin
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 4501 - +
  • [4] An application of immune algorithms for job-shop scheduling problems
    Miyashita, T
    PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON ASSEMBLY AND TASK PLANNING (ISATP2003), 2003, : 146 - 150
  • [5] Robust Start for Population-Based Algorithms Solving Job-Shop Scheduling Problems
    Nezhad, Majid Abdolrazzagh
    Abdullah, Salwani
    2011 3RD CONFERENCE ON DATA MINING AND OPTIMIZATION (DMO), 2011, : 219 - 226
  • [6] Solving Job-Shop Scheduling Problems by Genetic Algorithms Based on Building Block Hypothesis
    CHENG Rong~1
    International Journal of Plant Engineering and Management, 2006, (02) : 119 - 123
  • [7] Solving Open Job-Shop Scheduling Problems by SAT Encoding
    Koshimura, Miyuki
    Nabeshima, Hidetomo
    Fujita, Hiroshi
    Hasegawa, Ryuzo
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (08) : 2316 - 2318
  • [8] A heuristic combination method for solving job-shop scheduling problems
    Hart, E
    Ross, P
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN V, 1998, 1498 : 845 - 854
  • [9] Solving Fuzzy Job-Shop Scheduling Problems with a Multiobjective Optimizer
    Thanh-Do Tran
    Varela, Ramiro
    Gonzalez-Rodriguez, Ines
    Talbi, El-Ghazali
    KNOWLEDGE AND SYSTEMS ENGINEERING (KSE 2013), VOL 2, 2014, 245 : 197 - 209
  • [10] GA with Priority Rules for Solving Job-Shop Scheduling Problems
    Hasan, S. M. Kamrul
    Sarker, Ruhul
    Cornforth, David
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1913 - 1920
12345