On Energy Consumption and Productivity in a Mixed-Model Assembly Line Sequencing Problem

被引:1
|
作者
Paprocka, Iwona [1 ]
Krenczyk, Damian [1 ]
机构
[1] Silesian Tech Univ, Dept Engn Proc Automat & Integrated Mfg Syst, Konarskiego 18A, PL-44100 Gliwice, Poland
关键词
energy-efficient sequencing; grey wolf optimizer; mixed-model assembly line; car sequencing problem; ALGORITHM; OPTIMIZATION;
D O I
10.3390/en16207091
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
Mixed and multi-model assembly line sequencing problems are more practical than single-product models. The methods and selection criteria used must keep up with the constantly increasing level of variability, synchronize flows between various-often very energy-intensive production departments-and cope with high dynamics resulting from interrupted supply chains. The requirements for conscious use of Earth's limited natural resources and the need to limit energy consumption and interference in the environment force the inclusion of additional evaluation criteria focusing on the environmental aspect in optimization models. Effective sustainable solutions take into account productivity, timeliness, flow synchronization, and the reduction of energy consumption. In the paper, the problem of determining the sequence of vehicles for a selected class of multi-version assembly lines, in which the order restrictions were determined taking into account the above criteria, is presented. Original value of the paper is the development of the Grey Wolf Optimizer (GWO) for the mixed-model assembly lines sequencing problem. In the paper, a comparative analysis of the greedy heuristics, Simulated Annealing and GWO for a real case study of a mixed vehicle assembly line is presented. The GWO outperforms other algorithms. Overall research performance of the GWO on the sequencing problem is effective.
引用
收藏
页数:19
相关论文
共 50 条
  • [1] Real options approach for a mixed-model assembly line sequencing problem
    Rabbani, Masoud
    Rahimi-Vahed, Alireza
    Torabi, Seyed Ali
    [J]. International Journal of Advanced Manufacturing Technology, 2008, 37 (11-12): : 1209 - 1219
  • [2] Sequencing problem for a mixed-model assembly line in the Toyota production system
    Kotani, S
    Ito, T
    Ohno, K
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (23) : 4955 - 4974
  • [3] A Sequencing Problem for a Mixed-Model Assembly Line on Supply Chain Management
    Hugejile
    Hiraki, Shusaku
    Xu, Zhuqi
    Yang, Shaolan
    [J]. LTLGB 2012: PROCEEDINGS OF INTERNATIONAL CONFERENCE ON LOW-CARBON TRANSPORTATION AND LOGISTICS, AND GREEN BUILDINGS. VOL 1, 2013, : 481 - 487
  • [4] An imperialist competitive algorithm for a mixed-model assembly line sequencing problem
    Moradi, Hadi
    Zandieh, M.
    [J]. JOURNAL OF MANUFACTURING SYSTEMS, 2013, 32 (01) : 46 - 54
  • [5] Real options approach for a mixed-model assembly line sequencing problem
    Masoud Rabbani
    Alireza Rahimi-Vahed
    Seyed Ali Torabi
    [J]. The International Journal of Advanced Manufacturing Technology, 2008, 37 : 1209 - 1219
  • [6] Real options approach for a mixed-model assembly line sequencing problem
    Rabbani, Masoud
    Rahimi-Vahed, Alireza
    Torabi, Seyed Ali
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 37 (11-12): : 1209 - 1219
  • [7] MIXED-MODEL ASSEMBLY LINE SEQUENCING PROBLEMS
    DAREL, EM
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1978, 6 (04): : 313 - 323
  • [8] A SEQUENCING PROBLEM FOR A MIXED-MODEL ASSEMBLY-LINE IN A JIT PRODUCTION SYSTEM
    ZHAO, XB
    OHNO, K
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1994, 27 (1-4) : 71 - 74
  • [9] Product sequencing problem in Mixed-Model Assembly Line to minimize unfinished works
    Kim, Siwon
    Jeong, Bonju
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (02) : 206 - 214
  • [10] Sequencing problem for a hull mixed-model assembly line considering manufacturing complexity
    Zhong, Yu-Guang
    Lv, Xiao-Xiao
    Zhan, Yong
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2016, 30 (03) : 1461 - 1473