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 条
  • [31] ON THE JOB-SHOP SCHEDULING PROBLEM
    MANNE, AS
    [J]. OPERATIONS RESEARCH, 1960, 8 (02) : 219 - 223
  • [32] Approach by localization and genetic manipulation algorthm for flexible job-shop scheduling problem
    Kacem, I
    Hammadi, S
    Borne, P
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 2599 - 2604
  • [33] Unified Genetic Algorithm Approach for Solving Flexible Job-Shop Scheduling Problem
    Park, Jin-Sung
    Ng, Huey-Yuen
    Chua, Tay-Jin
    Ng, Yen-Ting
    Kim, Jun-Woo
    [J]. APPLIED SCIENCES-BASEL, 2021, 11 (14):
  • [34] Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach
    Bougloula, Aimade Eddine
    [J]. MANAGEMENT AND PRODUCTION ENGINEERING REVIEW, 2023, 14 (03) : 148 - 155
  • [35] An improved particle swarm optimization for multi-objective flexible job-shop scheduling problem
    Jia, Zhaohong
    Chen, Huaping
    Tang, Jun
    [J]. PROCEEDINGS OF 2007 IEEE INTERNATIONAL CONFERENCE ON GREY SYSTEMS AND INTELLIGENT SERVICES, VOLS 1 AND 2, 2007, : 1584 - 1589
  • [36] A PARTICLE SWARM OPTIMIZATION ALGORITHM FOR THE MULTI-OBJECTIVE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM
    Sun, Ying
    He, Jingbo
    [J]. JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2024, 25 (03) : 579 - 590
  • [37] A heuristic algorithm for the distributed and flexible job-shop scheduling problem
    Mohsen Ziaee
    [J]. The Journal of Supercomputing, 2014, 67 : 69 - 83
  • [38] A Combination of Two Simple Decoding Strategies for the No-wait Job Shop Scheduling Problem
    Valenzuela, Victor M.
    Brizuela, Carlos A.
    Cosio-Leon, M. A.
    Danisa Romero-Ocano, A.
    [J]. PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 864 - 871
  • [39] Flexible job-shop scheduling problem with resource recovery constraints
    Vallikavungal Devassia, Jobish
    Angelica Salazar-Aguilar, M.
    Boyer, Vincent
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (09) : 3326 - 3343
  • [40] A heuristic algorithm for the distributed and flexible job-shop scheduling problem
    Ziaee, Mohsen
    [J]. JOURNAL OF SUPERCOMPUTING, 2014, 67 (01): : 69 - 83
12345