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 条
  • [1] Minimizing makespan in no-wait job shops
    Bansal, N
    Mahdian, M
    Sviridenko, M
    MATHEMATICS OF OPERATIONS RESEARCH, 2005, 30 (04) : 817 - 831
  • [2] An Effective Meta-Heuristic for No-Wait Job Shops to Minimize Makespan
    Zhu, Jie
    Li, Xiaoping
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2012, 9 (01) : 189 - 198
  • [3] Iterative local search algorithm for no-wait flowshop scheduling problems to minimize makespan
    Wang, Chuyang
    Li, Xiaoping
    Wang, Qian
    PROCEEDINGS OF THE 2008 12TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS I AND II, 2008, : 908 - +
  • [4] A memory-based complete local search method with variable neighborhood structures for no-wait job shops
    Li, Xiaoping
    Xu, Haiyan
    Li, Minmin
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2016, 87 (5-8): : 1401 - 1408
  • [5] A memory-based complete local search method with variable neighborhood structures for no-wait job shops
    Xiaoping Li
    Haiyan Xu
    Minmin Li
    The International Journal of Advanced Manufacturing Technology, 2016, 87 : 1401 - 1408
  • [6] Hybrid evolutionary algorithm for no-wait flow shops to minimize makespan and total flowtime
    Liao, Xiaoping
    Liu, Yougen
    Li, Xiaoping
    Journal of Southeast University (English Edition), 2008, 24 (04) : 450 - 454
  • [7] A new exact algorithm for no-wait job shop problem to minimize makespan
    A. Ozolins
    Operational Research, 2020, 20 : 2333 - 2363
  • [8] A new exact algorithm for no-wait job shop problem to minimize makespan
    Ozolins, A.
    OPERATIONAL RESEARCH, 2020, 20 (04) : 2333 - 2363
  • [9] Meta-heuristic for no-wait job shops with makespan minimization
    Zhu, Jie
    Li, Xiaoping
    Zhang, Yi
    Wang, Qian
    PROCEEDINGS OF THE 2008 12TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS I AND II, 2008, : 874 - +
  • [10] Scheduling two-machine no-wait open shops to minimize makespan
    Liaw, CF
    Cheng, CY
    Chen, MC
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (04) : 901 - 917
12345