Rule-based hybrid EDA for three-stage assembly integrated scheduling problem with job batches transportation

被引：0
|
作者：
Deng C. [1 ]
Qian B. [1 ,2 ]
Hu R. [2 ]
Wang L. [3 ]
Sun Z.-X. [2 ]
机构：
[1] School of Mechanical and Electronic Engineering, Kunming University of Science and Technology, Kunming
[2] School of Information Engineering and Automation, Kunming University of Science and Technology, Kunming
[3] Department of Automation, Tsinghua University, Beijing
来源：
Kongzhi yu Juece/Control and Decision | 2020年 / 35卷 / 10期
关键词：
Estimation of distribution algorithm; Integrated scheduling; Job batch; Rule; Three-stage; Transportation;
D O I：
10.13195/j.kzyjc.2019.0307
中图分类号：
学科分类号：
摘要：
In the existing research on the three-stage assembly integrated scheduling problem model, the transportation time of each job is simplified to the same constant at the transportation stage. In practical situations, however, jobs are supposed to be transported separately in batches, due to the limitation of the number and the load capacity of transport vehicles. This paper studies the three-stage assembly integrated scheduling problem with job batches transportation (3sAISP_JBT) and the corresponding algorithm. The criterion of 3sAISP_JBT is to minimize the maximum completion time. Firstly, a mathematical model of 3sAISP_JBT is formulated in stages. Secondly, in order to reduce the overall computational complexity of solving 3sAISP_JBT, the first completed first transported (FCFT) rule and the first come first assembly (FCFA) rule are proposed for the sub-problems in the transportation and assembly stages, respectively. Thirdly, a hybrid estimation of distribution algorithm with rules (hybrid estimation of distribution algorithm with rules, HEDA_R) is proposed to solve 3sAISP_JBT. Finally, simulation experiments and algorithm comparisons verify the effectiveness of the proposed algorithms. © 2020, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码：2507 / 2513
页数：6
相关论文
共 20 条
  • [1] Zhou J., Intelligent manufacturing - Main direction of "made in China 2025, China Mechanical Engineering, 26, 17, pp. 2273-2284, (2015)
  • [2] Gupta J N D., Two-stage hybrid flowshop scheduling problem, Journal of the Operational Research Society, 39, 4, pp. 359-364, (1988)
  • [3] Gupta J N D, Hariri A, Potts C N., Scheduling a two-stage hybrid flow shop with parallel machines at the first stage, Annals of Operations Research, 69, 1, pp. 171-191, (1997)
  • [4] Sung C S, Kim H A., A tow-stage assembly scheduling problem for minimizing sum of completion times, Korea Industrial Technology Association, 113, 2, pp. 1038-1048, (2006)
  • [5] Fattahi P, Hosseini S M H, Jolai F., A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem, International Journal of Advanced Manufacturing Technology, 65, 5, pp. 787-802, (2013)
  • [6] Koulamas C, Kyparisis G J., The three-stage assembly flowshop scheduling problem, Computers & Operations Research, 28, 7, pp. 689-704, (2001)
  • [7] Hatami S, Ebrahimnejad S, Tavakkoli-Moghaddam R, Et al., Two meta-heuristics for three-stage assembly flowshop scheduling with sequence-dependent setup times, The International Journal of Advanced Manufacturing Technology, 50, 9, pp. 1153-1164, (2010)
  • [8] Malekidarounkolaei A, Modiri M, Tavakkolimoghaddam R, Et al., A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times, Journal of Industrial Engineering International, 8, 1, pp. 1-7, (2012)
  • [9] Farahani P, Grunow M, Gunther H O., Integrated production and distribution planning for perishable food products, Flexible Services and Manufacturing Journal, 24, 1, pp. 28-51, (2012)
  • [10] Joo C M, Kim B S., Rule-based meta-heuristics for integrated scheduling of unrelated parallel machines, batches, and heterogeneous delivery trucks, Applied Soft Computing, 53, pp. 457-476, (2017)
12