Chemical-reaction optimization for solving fuzzy job-shop scheduling problem with flexible maintenance activities

被引:43
|
作者
Li, Jun-qing [1 ]
Pan, Quan-ke [1 ,2 ]
机构
[1] Liaocheng Univ, Coll Comp Sci, Liaocheng 252059, Peoples R China
[2] Northeastern Univ, State Key Lab Synthet Automat Proc Ind, Shenyang 110819, Peoples R China
基金
美国国家科学基金会;
关键词
Fuzzy job-shop scheduling problem; Chemical-reaction optimization; Tabu search; Flexible maintenance activity; PROCESSING TIME; TABU SEARCH; ALGORITHM;
D O I
10.1016/j.ijpe.2012.11.005
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper proposes a hybrid chemical-reaction optimization (HCRO) algorithm for solving the job-shop scheduling problem with fuzzy processing time. The flexible maintenance activities under both resumable and non-resumable situations are also considered to make the problem more close to the reality. In the proposed algorithm, each solution is represented by a chemical molecule. Four elementary reactions, i.e., on-wall ineffective collision, inter-molecular ineffective collision, decomposition, and synthesis, are imposed. A well-designed crossover function is introduced in the synthesis and decomposition operators. In order to balance the exploitation and exploration, HCRO divides the evolution phase into two loop bodies: the first loop body contains on-wall ineffective collision and inter-molecular ineffective collision, while the second loop body includes all the four elementary reactions. Tabu search (TS) based local search is embedded in the proposed algorithm to enhance the convergence capability. A novel decoding approach is utilized to schedule each operation, while considering each flexible preventive maintenance activity on each machine. The proposed algorithm is tested on sets of the well-known benchmark instances. Through the analysis of experimental results, the highly effective performance of the proposed HCRO algorithm is shown against three efficient algorithms from the literature, i.e., SMGA (Sakawa and Mori, 1999), GPSO (Niu et al., 2008), and RKGA (Zheng et al., 2010). (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:4 / 17
页数:14
相关论文
共 50 条
  • [21] Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints
    Mati, Yazid
    Lahlou, Chams
    Dauzere-Peres, Stephane
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (08) : 2169 - 2182
  • [22] A Constructive Heuristic for Solving the Job-Shop Scheduling Problem
    Mellado, R.
    Cubillos, C.
    Cabrera, D.
    [J]. IEEE LATIN AMERICA TRANSACTIONS, 2016, 14 (06) : 2758 - 2763
  • [23] Genetic Algorithm for Solving Job-Shop Scheduling Problem
    Li XiaoBo
    [J]. 2011 AASRI CONFERENCE ON INFORMATION TECHNOLOGY AND ECONOMIC DEVELOPMENT (AASRI-ITED 2011), VOL 1, 2011, : 296 - 298
  • [24] A novel algorithm for solving job-shop scheduling problem
    Muthiah, A.
    Rajkumar, R.
    [J]. MECHANIKA, 2017, 23 (04): : 610 - 616
  • [25] Genetic algorithm for solving job-shop scheduling problem
    Tsinghua Univ, Beijing, China
    [J]. Jiguang Zazhi, 4 (1-5):
  • [26] Genetic Algorithm for Solving Job-Shop Scheduling Problem
    Li XiaoBo
    [J]. 2011 INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND NEURAL COMPUTING (FSNC 2011), VOL IV, 2011, : 296 - 298
  • [27] Multi-objective Integrated Optimization Problem of Preventive Maintenance Planning and Flexible Job-Shop Scheduling
    Jing, Zha
    Hua, Jin
    Yi, Zhu
    [J]. PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT 2016: THEORY AND APPLICATION OF INDUSTRIAL ENGINEERING, 2017, : 137 - 141
  • [28] SOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH TABU SEARCH
    BARNES, JW
    CHAMBERS, JB
    [J]. IIE TRANSACTIONS, 1995, 27 (02) : 257 - 263
  • [29] A Genetic Algorithm for the Flexible Job-Shop Scheduling Problem
    Wang, Jin Feng
    Du, Bi Qiang
    Ding, Hai Min
    [J]. ADVANCED RESEARCH ON COMPUTER SCIENCE AND INFORMATION ENGINEERING, PT I, 2011, 152 : 332 - 339
  • [30] A genetic algorithm for the Flexible Job-shop Scheduling Problem
    Pezzella, F.
    Morganti, G.
    Ciaschetti, G.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (10) : 3202 - 3212