Parallel two-sided assembly line balancing with tools and tasks sharing

被引:10
|
作者
Yadav, Ashish [1 ]
Kulhary, Ramawatar [1 ]
Nishad, Rupesh [1 ]
Agrawal, Sunil [1 ]
机构
[1] PDPM Indian Inst Informat Technol Design & Mfg, Dept Mech Engn, Jabalpur, India
关键词
Mathematical model; Assembly line balancing; Parallel two-sided assembly line balancing; Task sharing; Tool sharing; PARTICLE SWARM OPTIMIZATION; MODEL; ALGORITHM; SYSTEM;
D O I
10.1108/AA-02-2018-025
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Purpose Parallel two-sided assembly lines are usually designed to produce large-sized products such as trucks and buses. In parallel two-sided assembly lines, both left and right sides of the line are used for manufacturing one or more products on two or more assembly lines located parallel to each other. The purpose of this paper is to develop a new mathematical model for the parallel two-sided assembly line balancing problem that helps to evaluate and validate the balancing operations of the machines such as removal of tools and fixtures and reallocating the operators. Design/methodology/approach The proposed approach is explained with the help of an example problem. In all, 22 test problems are formed using the benchmark problems P9, P12, P16 and P24. The results obtained are compared among approaches of the task(s) shared, tool(s) shared and both tool(s) and task(s) shared for effect on efficiency as the performance measure. The solution presented here follows the exact solution procedure that is solved by Lingo 16 solver. Findings Based on the experiments, line efficiency decreases when only tools are shared and increases when only tasks are shared. Results indicate that by sharing tasks and tools together, better line efficiency is obtained with less cost of tools and fixtures. Originality/value According to the author's best knowledge, this paper is the first to address the tools and tasks sharing between any pair of parallel workstations.
引用
收藏
页码:833 / 846
页数:14
相关论文
共 50 条
  • [31] Branch, bound and remember algorithm for two-sided assembly line balancing problem
    Li, Zixiang
    Kucukkoc, Ibrahim
    Zhang, Zikai
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 284 (03) : 896 - 905
  • [32] An improved ant colony optimization for two-sided assembly line balancing problem
    Zheng, Q.-X. (zqxlm1978@163.com), 1600, Chinese Institute of Electronics (42):
  • [33] Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines
    Kucukkoc, Ibrahim
    Zhang, David Z.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (12) : 3665 - 3687
  • [34] Two-sided assembly lines balancing with assignment restrictions
    Purnomo, Hindriyanto Dwi
    Wee, Hui-Ming
    Rau, Hsin
    MATHEMATICAL AND COMPUTER MODELLING, 2013, 57 (1-2) : 189 - 199
  • [35] Two-sided assembly line balancing using an ant-colony-based heuristic
    Baykasoglu, Adil
    Dereli, Türkay
    International Journal of Advanced Manufacturing Technology, 2008, 36 (5-6): : 582 - 588
  • [36] Two-sided assembly line balancing using an ant-colony-based heuristic
    Baykasoglu, Adil
    Dereli, Tuerkay
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 36 (5-6): : 582 - 588
  • [37] Two-sided Assembly Line Balancing with Multiple Constraints: a Study of the Resource Cost Optimization
    Ma, Dong-Sheng
    Song, Hua-Ming
    INTERNATIONAL CONFERENCE ON MECHANICS AND CONTROL ENGINEERING (MCE 2015), 2015, : 375 - 381
  • [38] Bee colony intelligence in zone constrained two-sided assembly line balancing problem
    Ozbakir, Lale
    Tapkan, Pinar
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (09) : 11947 - 11957
  • [39] Variable neighborhood search for the second type of two-sided assembly line balancing problem
    Lei, Deming
    Guo, Xiuping
    COMPUTERS & OPERATIONS RESEARCH, 2016, 72 : 183 - 188
  • [40] Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem
    Li, Zixiang
    Dey, Nilanjan
    Ashour, Amira S.
    Tang, Qiuhua
    NEURAL COMPUTING & APPLICATIONS, 2018, 30 (09): : 2685 - 2696