scholarly journals Proposed assembly line balancing using mixed integer programming to minimize idle time of union fuselage

Author(s):  
Ni Putu Cynthia Sasmita Dewi ◽  
Dida Diah Damayanti ◽  
Murni Dwi Astuti
2013 ◽  
Vol 437 ◽  
pp. 748-751
Author(s):  
Chi Yang Tsai ◽  
Yi Chen Wang

This research considers the problem of scheduling jobs on unrelated parallel machines with inserted idle times to minimize the earliness and tardiness. The aims at investigating how particular objective value can be improved by allowing machine idle time and how quality solutions can be more effectively obtained. Two mixed-integer programming formulations combining with three dispatching rules are developed to solve such scheduling problems. They can easy provide the optimal solution to problem involving about nine jobs and four machines. From the results of experiments, it is found that: (1) the inserted idle times decreases objective values more effectively; (2) three dispatching rules are very competitive in terms of efficiency and quality of solutions.


2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Ashish Yadav ◽  
Shashank Kumar ◽  
Sunil Agrawal

PurposeMulti-manned assembly lines are designed to produce large-sized products, such as automobiles. In this paper, a multi-manned assembly line balancing problem (MALBP) is addressed in which a group of workers simultaneously performs different tasks on a workstation. The key idea in this work is to improve the workstation efficiency and worker efficiency of an automobile plant by minimizing the number of workstations, the number of workers, and the cycle time of the MALBP.Design/methodology/approachA mixed-integer programming formulation for the problem is proposed. The proposed model is solved with benchmark test problems mentioned in research papers. The automobile case study problem is solved in three steps. In the first step, the authors find the task time of all major tasks. The problem is solved in the second step with the objective of minimizing the cycle time for the sub-tasks and major tasks, respectively. In the third step, the output results obtained from the second step are used to minimize the number of workstations using Lingo 16 solver.FindingsThe experimental results of the automobile case study show that there is a large improvement in workstation efficiency and worker efficiency of the plant in terms of reduction in the number of workstations and workers; the number of workstations reduced by 24% with a cycle time of 240 s. The reduced number of workstations led to a reduction in the number of workers (32% reduction) working on that assembly line.Practical implicationsFor assembly line practitioners, the results of the study can be beneficial where the manufacturer is required to increased workstation efficiency and worker efficiency and reduce resource requirement and save space for assembling the products.Originality/valueThis paper is the first to apply a multi-manned assembly line balancing approach in real life problem by considering the case study of an automobile plant.


2017 ◽  
Vol 37 (1) ◽  
pp. 34-50 ◽  
Author(s):  
Abdolreza Roshani ◽  
Farnaz Ghazi Nezami

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.


1971 ◽  
Vol 3 (1) ◽  
pp. 61-68 ◽  
Author(s):  
S. R. Thangavelu ◽  
C. M. Shetty

2006 ◽  
Vol 532-533 ◽  
pp. 1076-1079
Author(s):  
Shui Li Yang ◽  
Wei Ping Huang

Through the comparative analysis, the features of the mass customization assembly line are obtained. The corresponding genetic algorithm is designed with the total idle time and overloading time of the minimized assembly line as the target function, which is used to resolve the distribution problems of the operation elements in mass customization assembly line. The improved genetic operators can heighten the overall optimal solution ability of genetic algorithm convergence. The calculated examples indicate that this algorithm is the effective method for seeking out solution to the problems of operation elements in the mass customization assembly line.


Sign in / Sign up

Export Citation Format

Share Document