scholarly journals MILP model for integrated line balancing and model sequencing problems for Mixed-Model Two-Sided Assembly Line

2017 ◽  
Vol 13 (4-1) ◽  
pp. 367-371
Author(s):  
Nur Intan Liyana Mohd Azmi ◽  
Zaitul Marlizawati Zainuddin ◽  
Zaitul Marlizawati Zainuddin ◽  
Rashidah Ahmad ◽  
Rashidah Ahmad
Keyword(s):  
Assembly Line ◽  
Mixed Model ◽  
Line Balancing ◽  
Mixed Integer ◽  
Test Cases ◽  
Sequencing Problems ◽  
Model Sequencing ◽  
Model Sequence ◽  
Practical Constraints ◽  
Algebraic Modelling

This research explores two interrelated problems in Mixed-Model Two-Sided Assembly Line (MMTSAL), which are line balancing and model sequencing.  These two problems are solved simultaneously using Mixed Integer Linear Programming (MILP) with the objectives of minimizing total utility work and idle time by considering various practical constraints.  The problem is analyzed using small-size to large-sized test cases using General Algebraic Modelling System (GAMS) with the solver CPLEX.  Experimental results indicate that integrating the problems help to minimize the proposed objective function. Also, it is found that the feasible solution for model sequence with the assignment of tasks to assembly line is optimal. 

Mixed-model multi-manned assembly line balancing problem: a mathematical model and a simulated annealing approach

2017 ◽  
Vol 37 (1) ◽  
pp. 34-50 ◽  
Author(s):  
Abdolreza Roshani ◽  
Farnaz Ghazi Nezami
Keyword(s):  
Simulated Annealing ◽  
Assembly Line ◽  
Mixed Model ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Mixed Integer ◽  
Computational Time ◽  
Content Type ◽  
Mip Model ◽  
Assembly Line Balancing Problem

Purpose This paper aims to study a generalized type of mixed-model assembly line with multi-manned workstations where multiple workers simultaneously perform different tasks on the same product. This special kind of assembly line is usually utilized to assemble different models of large products, such as buses and trucks, on the same production line. Design/methodology/approach To solve the mixed-model multi-manned assembly line balancing problem optimally, a new mixed-integer-programming (MIP) model is presented. The proposed MIP model is nondeterministic polynomial-time (NP)-hard, and as a result, a simulated annealing (SA) algorithm is developed to find the optimal or near-optimal solution in a small amount of computation time. Findings The performance of the proposed algorithm is examined for several test problems in terms of solution quality and running time. The experimental results show that the proposed algorithm has a satisfactory performance from computational time efficiency and solution accuracy. Originality/value This research is the very first study that minimizes the number of workers and workstations simultaneously, with a higher priority set for the number of workers, in a mixed-model multi-manned assembly line setting using a novel MIP model and an SA algorithm.

Sign in / Sign up

Export Citation Format

Share Document