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 条
  • [31] Minimizing makespan for a no-wait flowshop using genetic algorithm
    Chaudhry, Imran Ali
    Khan, Abdul Munem
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2012, 37 (06): : 695 - 707
  • [32] Minimizing makespan for a no-wait flowshop using genetic algorithm
    IMRAN ALI CHAUDHRY
    ABDUL MUNEM KHAN
    Sadhana, 2012, 37 : 695 - 707
  • [33] A new local search algorithm for no-wait fowshops with setup time
    Wang, Chuyang
    Li, Xiaoping
    Wang, Qian
    Yuan, Yingchun
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2010, 47 (04): : 653 - 662
  • [34] A HYBRID LOCAL SEARCH ALGORITHM FOR NO-WAIT FLOWSHOP SCHEDULING PROBLEM
    Wang, Jing
    Li, Tieke
    Zhang, Wenxue
    ICIM 2008: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2008, : 157 - 163
  • [35] A fast hybrid tabu search algorithm for the no-wait job shop problem
    Bozejko, Wojciech
    Makuchowski, Mariusz
    COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (04) : 1502 - 1509
  • [36] An Improved Quantum-Inspired Evolution Algorithm for No-Wait Flow Shop Scheduling Problem to Minimize Makespan
    Zhao, Jin-Xi
    Qian, Bin
    Hu, Rong
    Zhang, Chang-Sheng
    Li, Zi-Hui
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, ICIC 2016, PT I, 2016, 9771 : 536 - 547
  • [37] An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
    Nagano, Marcelo Seido
    de Almeida, Fernando Siqueira
    Miyata, Hugo Hissashi
    ENGINEERING OPTIMIZATION, 2021, 53 (08) : 1431 - 1449
  • [38] A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops
    Laha, Dipak
    Gupta, Jatinder N. D.
    Sapkal, Sagar U.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2014, 65 (10) : 1611 - 1624
  • [39] A Local and Global Search Combine Particle Swarm Optimization Algorithm for Job-Shop Scheduling to Minimize Makespan
    Lian, Zhigang
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2010, 2010
  • [40] No-wait and blocking job-shops: Challenging problems for GA's
    Brizuela, CA
    Zhao, Y
    Sannomiya, N
    2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 2349 - 2354
12345