Complete local search with limited memory algorithm for no-wait job shops to minimize makespan

被引：35
|
作者：
Zhu, Jie [1 ]
Li, Xiaoping
Wang, Qian
机构：
[1] Southeast Univ, Sch Engn & Comp Sci, Nanjing 210096, Peoples R China
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2009年 / 198卷 / 02期
基金：
中国国家自然科学基金; 国家高技术研究发展计划(863计划);
关键词：
No-wait; Job shop; Timetabling; Sequencing; SCHEDULING PROBLEMS;
D O I：
10.1016/j.ejor.2008.09.015
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, no-wait job shop problems with makespan minimization are considered. It is well known that these problems are strongly NP-hard. The problem is decomposed into the sequencing and the timetabling components. Shift timetabling is developed for the timetabling component. An effective method, CLLM (complete local search with limited memory), is presented by integrating with shift timetabling for the sequencing component. Experimental results show that CLLM outperforms all the existing effective algorithms for the considered problem with a little more computation time. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：378 / 386
页数：9
相关论文
共 50 条
  • [41] A Comparison Between Genetic Algorithm and Cuckoo Search Algorithm to Minimize the Makespan for Grid Job Scheduling
    Ghosh, Tarun Kumar
    Das, Sanjoy
    Barman, Subhabrata
    Goswami, Rajmohan
    ADVANCES IN COMPUTATIONAL INTELLIGENCE, 2017, 509 : 141 - 147
  • [42] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    Li XiaoPing
    Cheng, Wu
    SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2008, 51 (07): : 896 - 909
  • [43] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    XiaoPing Li
    Cheng Wu
    Science in China Series F: Information Sciences, 2008, 51
  • [44] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    LI XiaoPing1
    2 Key Laboratory of Computer Network and Information Integration (Southeast University)
    3 Department of Automation
    Science in China(Series F:Information Sciences), 2008, (07) : 896 - 909
  • [45] Algorithm Based on K-Neighborhood Search for No-wait Job Shop Scheduling Problems
    Wang, Yong Ming
    Yin, Hong Li
    2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 4221 - 4225
  • [46] An effective iterated local search algorithm for the distributed no-wait flowshop scheduling problem
    Avci, Mustafa
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 120
  • [47] A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
    Tellache, Nour ElHouda
    Kerbache, Laoucine
    COMPUTERS & OPERATIONS RESEARCH, 2023, 156
  • [48] A divide and conquer-based greedy search for two-machine no-wait job shop problems with makespan minimisation
    Zhu, Jie
    Li, Xiaoping
    Shen, Weiming
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (10) : 2692 - 2704
  • [49] Genetic Algorithm to minimize flowtime in a no-wait flowshop scheduling problem
    Chaudhry, Imran A.
    Ahmed, Riaz
    Khan, Abdul Munem
    27TH INTERNATIONAL CONFERENCE ON CADCAM, ROBOTICS AND FACTORIES OF THE FUTURE 2014, 2014, 65
  • [50] No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
    Allahverdi, Ali
    Aydilek, Harun
    Aydilek, Asiye
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 365
12345