A Swarm Intelligence Approach to Flexible Job-Shop Scheduling Problem with No-Wait Constraint in Remanufacturing

被引：0
|
作者：
Sundar, Shyam [1 ]
Suganthan, P. N. [1 ]
Chua, T. J. [2 ]
机构：
[1] Nanyang Technol Univ Singapore, Sch Elect & Elect Engn, Singapore 639798, Singapore
[2] Singapore Inst Mfg Technol, Singapore 638075, Singapore
来源：
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II | 2013年 / 7895卷
关键词：
Swarm Intelligence; Artificial Bee Colony Algorithm; No-wait; Flexible Job-shop; Scheduling; ALGORITHM;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper addresses a flexible job-shop scheduling problem with no-wait constraint (FJSPNW) which combines features of two well-known combinatorial optimization problems flexible job-shop scheduling problem and no-wait job-shop scheduling problem. To solve FJSPNW with the objective of minimizing the makespan, an artificial bee colony (ABC) algorithm is proposed. This problem finds application in remanufacturing scheduling systems. ABC algorithm is a recently developed swarm intelligence technique based on intelligent foraging behavior of honey bee swarm. Since its inception, it has shown promising performance for the solution of numerous hard optimization problems. Numerical experiments have been performed on a set of standard benchmark instances in order to demonstrate the effectiveness of ABC algorithm.
引用
收藏
页码：593 / +
页数：3
相关论文
共 50 条
  • [1] A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint
    Sundar, Shyam
    Suganthan, P. N.
    Jin, Chua Tay
    Xiang, Cai Tian
    Soon, Chong Chin
    [J]. SOFT COMPUTING, 2017, 21 (05) : 1193 - 1202
  • [2] A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint
    Shyam Sundar
    P. N. Suganthan
    Chua Tay Jin
    Cai Tian Xiang
    Chong Chin Soon
    [J]. Soft Computing, 2017, 21 : 1193 - 1202
  • [3] Job-shop scheduling with blocking and no-wait constraints
    Mascis, A
    Pacciarelli, D
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 143 (03) : 498 - 517
  • [4] An Evolutionary Algorithm Based Hyper-heuristic for the Job-Shop Scheduling Problem with No-Wait Constraint
    Chaurasia, Sachchida Nand
    Sundar, Shyam
    Jung, Donghwi
    Lee, Ho Min
    Kim, Joong Hoon
    [J]. HARMONY SEARCH AND NATURE INSPIRED OPTIMIZATION ALGORITHMS, 2019, 741 : 249 - 257
  • [5] A polynomial algorithm for a two-machine no-wait job-shop scheduling problem
    Kravchenko, SA
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (01) : 101 - 107
  • [6] A cooperative coevolutionary algorithm approach to the no-wait job shop scheduling problem
    Valenzuela-Alcaraz, Victor M.
    Cosio-Leon, M. A.
    Danisa Romero-Ocano, A.
    Brizuela, Carlos A.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2022, 194
  • [7] A PSEUDO-POLYNOMIAL ALGORITHM FOR A 2-MACHINE NO-WAIT JOB-SHOP SCHEDULING PROBLEM
    KUBIAK, W
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 43 (03) : 267 - 270
  • [8] A hybrid particle swarm optimization approach for the job-shop scheduling problem
    Xia, Wei-Jun
    Wu, Zhi-Ming
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 29 (3-4): : 360 - 366
  • [9] A hybrid particle swarm optimization approach for the job-shop scheduling problem
    Wei-jun Xia
    Zhi-ming Wu
    [J]. The International Journal of Advanced Manufacturing Technology, 2006, 29 : 360 - 366
  • [10] An effective particle swarm optimization algorithm for flexible job-shop scheduling problem
    Nouiri, Maroua
    Jemai, Abderezak
    Ammari, Ahmed Chiheb
    Bekrar, Abdelghani
    Niar, Smail
    [J]. PROCEEDINGS OF 2013 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IEEE-IESM 2013), 2013, : 29 - 34
12345