A modified artificial bee colony algorithm for order acceptance in two-machine flow shops

被引:56
|
作者
Wang, Xiuli [1 ]
Xie, Xingzi [1 ]
Cheng, T. C. E. [2 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Econ & Management, Nanjing 210094, Jiangsu, Peoples R China
[2] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Scheduling; Order acceptance; Artificial bee colony algorithm; Revenue; VEHICLE-ROUTING PROBLEM; MINIMIZING TOTAL TARDINESS; HEAVILY LOADED SHOP; WEIGHTED TARDINESS; GENETIC ALGORITHM; ABC ALGORITHM; JOB SELECTION; TABU SEARCH; OPTIMIZATION;
D O I
10.1016/j.ijpe.2012.06.003
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We consider a two-stage make-to-order production system characterized by limited production capacity and tight order due dates. We want to make joint decisions on order acceptance and scheduling to maximize the total net revenue. The problem is computationally intractable. In view of the fact that artificial bee colony algorithm has been shown to be an effective evolutionary algorithm to handle combinatorial optimization problems, we first conduct a pilot study of applying the basic artificial bee colony algorithm to treat our problem. Based on the results of the pilot study and the problem characteristics, we develop a modified artificial bee colony algorithm. The experimental results show that the modified artificial bee colony algorithm is able to generate good solutions for large-scale problem instances. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:14 / 23
页数:10
相关论文
共 50 条
  • [1] On two-machine stochastic flow shops
    Kamburowski, J
    Kannan, D
    DECISION SCIENCES INSTITUTE, 1997 ANNUAL MEETING, PROCEEDINGS, VOLS 1-3, 1997, : 930 - 932
  • [2] Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations
    Esmaeilbeigi, Rasul
    Charkhgard, Parisa
    Charkhgard, Hadi
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (02) : 419 - 431
  • [3] Two modified versions of artificial bee colony algorithm
    Alizadegan, Amir
    Asady, Babak
    Ahmadpour, Mohammad
    APPLIED MATHEMATICS AND COMPUTATION, 2013, 225 : 601 - 609
  • [4] An Improved Artificial Bee Colony Algorithm for Order Acceptance and Scheduling in Flow Shop with Hybrid Blocking
    Jin, Chunhua
    INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING, 2016, 9 (12): : 333 - 339
  • [5] Two-machine flow shops with limited machine availability
    Kubiak, W
    Blazewicz, J
    Formanowicz, P
    Breit, J
    Schmidt, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 136 (03) : 528 - 540
  • [6] A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
    Tasgetiren, M. Fatih
    Pan, Quan-Ke
    Suganthan, P. N.
    Chen, Angela H-L
    INFORMATION SCIENCES, 2011, 181 (16) : 3459 - 3475
  • [7] A modified artificial bee colony algorithm
    Gao, Wei-feng
    Liu, San-yang
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 687 - 697
  • [8] Order acceptance and scheduling in a two-machine flowshop
    Wang, Xiuli
    Xie, Xingzi
    Cheng, T. C. E.
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) : 366 - 376
  • [9] Discrete lot streaming in two-machine flow shops
    Chen, Jiang
    Steiner, George
    INFOR Journal, 1999, 37 (02): : 160 - 173
  • [10] Scheduling two-machine flow shops with exact delays
    Leung, Joseph Y. -T.
    Li, Haibing
    Zhao, Hairong
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (02) : 341 - 359