Optimal workforce assignment to operations of a paced assembly line

Dolgui, Alexandre; Kovalev, Sergey; Kovalyov, Mikhail Y.; Malyutin, Sergey; Soukhal, Ameur

doi:10.1016/j.ejor.2017.06.017

Cited by 45 publications

(21 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Academic studies of the workforce planning problems for production lines were initiated by Akagi et al [1] and Wilson [44]. Recent surveys of the results in this field are given by Battaïa and Dolgui [6], Battaïa et al [5], De Bruecker et al [16] and Dolgui et al [17]. Further information can be found in Vairaktarakis et al [42], Polat et al [32], Dalle Mura and Dini [14], Yilmas and Yilmas [47], Zacharia and Nearchou [48] and Ritt et al [34].…”

Section: Literature Reviewmentioning

confidence: 99%

“…MinMaxSum problem is a subproblem of the industrial problem studied within European project "amePLM" (Battaïa et al [5], Dolgui et al [17]). In the industrial case, two or three automotive engines (two or three part types) are produced in the proportion of 75% and 25% in the case of two engines and 75% and 20% and 5% in the case of three engines on an assembly line comprising of 11 stations.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Minimizing the number of workers in a paced mixed-model assembly line

Delorme

Dolgui

Kovalev

et al. 2019

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

We study a problem of minimizing the maximum number of identical workers over all cycles of a paced assembly line comprised of m stations and executing n parts of k types. There are lower and upper bounds on the workforce requirements and the cycle time constraints. We show that this problem is equivalent to the same problem without the cycle time constraints and with fixed workforce requirements. We prove that the problem is NP-hard in the strong sense if m = 3 and if m = 4 and the workforce requirements are station independent, and present an Integer Linear Programming model, an enumeration algorithm and a dynamic programming algorithm. Polynomial in k and polynomial in n algorithms for special cases with two part types or two stations are also given. The relation to the Bottleneck Traveling Salesman Problem and its generalizations are discussed.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Minimizing the number of workers in a paced mixed-model assembly line

Delorme

Dolgui

Kovalev

et al. 2019

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

show abstract

“…Problem consists of assigning workers to work station. Study proposed a solution using computer experiment with real and simulated data [19]. Productivity is a key parameter for all manufacturing industries.…”

Section: Literature Reviewmentioning

confidence: 99%

Capacity Enhancement through Value Stream Mapping and Line Balancing Technique in Compressor Assembly Line

Dinesh¹,

Sathishkumar²,

Krishnakumar³

2019

IJITEE

View full text Add to dashboard Cite

In competitive global market, manufacturers are urged to know the customer needs well in advance to serve the customer. Customer satisfaction and on time delivery of products play a vital role in establishing long and healthy relationship. When demand for a product is growing, manufacturer ought to plan their activity well in advance to ensure product availability to customer. Capacity planning is done considering dynamically varying demand of customers. Manufacturers are also continuously thriving to reduce cost by enhancing machine utilization. But, Capacity loss is unavoidable in any manufacturing facility. And also it is basic necessity that production capacity to be enhanced, with production cost in consideration. The study intends to increase the capacity of an assembly line and in parallel optimize the manpower (productivity improvement). It deals with identifying non value adding activities and handling them to enhance the capacity of an assembly plant to meet forecast demand. These improvements achieved by using the lean tool, “Value stream mapping (VSM)” which helps to segregate value addition and non-value addition activities for each machine or work station and also will help in continual improvement. Current and future state mapping of assembly line will showcase the lean waste involved in process, current issues, line imbalance, possibilities of further improvements, gap between takt and actual cycle time, inventory at each assembly points, WIP machines and lead time at each stations. These individual issues are sorted out by generating kaizens at each station, which involves brain storming and expert opinion, involving all members of team. These improvements will spread over the entire process flow chain as small pockets. These many numbers of small pockets of improvements is harvested by using another lean tool, “Line balancing”. Line balancing will improve the overall line efficiency and hence capacity enhancement & man power optimization is achieved. The benefits of value stream mapping followed by line balancing technique had yielded capacity enhancement by 86%, manpower reduction by 28%, productivity improvement by from 1.24 to 1.70 units per person per day, through put time reduced from 325.6 to 259.5 mins, line efficiency improved from 79.7% to 97.9% and VA ratio improved from 33 to 37%.

show abstract

“…The study of assembly line design, balancing, and scheduling problems is widely reported in the literature (Dolgui et al 2018). Although worker assignment and two-sided assembly line balancing have been thoroughly studied separately, there is limited work reported considering all the characteristics of the considered problem, namely the integrated two-sided assembly line worker assignment and balancing problem with cycle time minimization criterion.…”

Section: Literature Reviewmentioning

confidence: 99%

Model and migrating birds optimization algorithm for two-sided assembly line worker assignment and balancing problem

Janardhanan

Nielsen

2018

Soft Comput

View full text Add to dashboard Cite

Worker assignment is a relatively new problem in assembly lines that typically is encountered in situations in which the workforce is heterogeneous. The optimal assignment of a heterogeneous workforce is known as the assembly line worker assignment and balancing problem (ALWABP). This problem is different from the well-known simple assembly line balancing problem concerning the task execution times, and it varies according to the assigned worker. Minimal work has been reported in worker assignment in two-sided assembly lines. This research studies worker assignment and line balancing in two-sided assembly lines with an objective of minimizing the cycle time (TALWABP). A mixed-integer programming model is developed, and CPLEX solver is used to solve the small-size problems. An improved migrating birds optimization (MBO) algorithm is employed to deal with the large-size problems due to the NP-hard nature of the problem. The proposed algorithm utilizes a restart mechanism to avoid being trapped in the local optima. The solutions obtained using the proposed algorithms are compared with well-known metaheuristic algorithms such as artificial bee colony and simulated annealing. Comparative study and statistical analysis indicate that the proposed algorithm can achieve the optimal solutions for small-size problems, and it shows superior performance over benchmark algorithms for large-size problems.

show abstract

Optimal workforce assignment to operations of a paced assembly line

Cited by 45 publications

References 53 publications

Minimizing the number of workers in a paced mixed-model assembly line

Minimizing the number of workers in a paced mixed-model assembly line

Capacity Enhancement through Value Stream Mapping and Line Balancing Technique in Compressor Assembly Line

Model and migrating birds optimization algorithm for two-sided assembly line worker assignment and balancing problem

Contact Info

Product

Resources

About