A method for assembly line balancing with more than one worker in each station

Akagi, Fumio; Osaki, Hirokazu; Kikuchi, Susumu

doi:10.1080/00207548308942409

Cited by 54 publications

(24 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This impact is illustrated in Fig. 4 for instances of the problem F easible (3). One can see that the higher values of Idle imply the smaller solution time of the problem F easible (3).…”

Section: Exact Solution By Milp Solvermentioning

confidence: 90%

Optimal workforce assignment to operations of a paced assembly line

Dolgui

Kovalev

Kovalyov

et al. 2018

European Journal of Operational Research

View full text Add to dashboard Cite

To cite this version:Alexandre Dolgui, Sergey Kovalev, Mikhail Kovalyov, Sergey Malyutin, Ameur Soukhal. Optimal workforce assignment to operations of a paced assembly line. European Journal of Operational Research, Elsevier, 2018, 264 (1), pp.200-211. 10.1016/j.ejor.2017 Optimal workforce assignment to operations of a paced assembly line AbstractWe study a paced assembly line intended for manufacturing different products. Workers with identical skills perform non-preemptable operations whose assignment to stations is known. Operations assigned to the same station are executed sequentially, and they should follow the given precedence relations. Operations assigned to different stations can be performed in parallel.The operation's processing time depends on the number of workers performing this operation.The problem consists in assigning workers to operations such that the maximal number of workers employed simultaneously in the assembly line is minimized, the line cycle time is not exceeded and the box constraints specifying the possible number of workers for each operation are not violated. We show that the general problem is NP-hard in the strong sense, develop conventional and randomized heuristics, propose a reduction to a series of feasibility problems, present a MILP model for the feasibility problem, show relation of the feasibility problem to multi-mode project scheduling and multiprocessor scheduling, establish computational complexity of several special cases based on this relation and provide computer experiments with real and simulated data.

show abstract

“…This impact is illustrated in Fig. 4 for instances of the problem F easible (3). One can see that the higher values of Idle imply the smaller solution time of the problem F easible (3).…”

Section: Exact Solution By Milp Solvermentioning

confidence: 90%

Optimal workforce assignment to operations of a paced assembly line

Dolgui

Kovalev

Kovalyov

et al. 2018

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…According to Baybars (1986), the simultaneous assembly line balancing and choice of processing alternatives is known as assembly line design problem (ALDP). For further research see Pinto et al (1983), Akagi et al (1983), Graves and Lamar (1983), Wilhelm (1997, 1998), Wilhelm (1999), Bukchin and Tzur (2000), Nicosia et al (2002). A mathematical program for such an ALDP is presented below:…”

Section: Wage Synergiesmentioning

confidence: 99%

A versatile algorithm for assembly line balancing

Boysen

Fliedner

2008

European Journal of Operational Research

View full text Add to dashboard Cite

“…In the works of Akagi et al (1983), Wilson (1986) and Lutz and Davis (1994), it is assumed that the performance of the workers performing the same task is the same, and that the task processing time depends solely on the number of workers assigned to this task. Thus, they made the same assumption as we do for problem P.…”

Section: Overall Statement Of the Problem And Related Literaturementioning

confidence: 99%

Workforce minimization for a mixed-model assembly line in the automotive industry

Battaïa

Delorme

Dolgui

et al. 2015

International Journal of Production Economics

View full text Add to dashboard Cite

International audienceA paced assembly line consisting of several workstations is considered. This line is intended to assemble products of different types. The sequence of products is given. The sequence of technological tasks is common for all types of products. The assignment of tasks to the stations and task sequence on each station are known and cannot be modified, and they do not depend on the product type. Tasks assigned to the same station are performed sequentially. The processing time of a task depends on the number of workers performing this task. Workers are identical and versatile. If a worker is assigned to a task, he/she works on this task from its start till completion. Workers can switch between the stations at the end of each task and the time needed by any worker to move from one station to another one can be neglected. At the line design stage, it is necessary to know how many workers are necessary for the line. To know the response to this question we will consider each possible takt and assign workers to tasks so that the total number of workers is minimized, provided that a given takt time is satisfied. The maximum of minimal numbers of workers for all takts will be considered as the necessary number of workers for the line. Thus, the problem is to assign workers to tasks for a takt. We prove that this problem is NP-hard in the strong sense, we develop an integer linear programming formulation to solve it, and propose conventional and randomized heuristics

show abstract

A method for assembly line balancing with more than one worker in each station

Cited by 54 publications

References 3 publications

Optimal workforce assignment to operations of a paced assembly line

Optimal workforce assignment to operations of a paced assembly line

A versatile algorithm for assembly line balancing

Workforce minimization for a mixed-model assembly line in the automotive industry

Contact Info

Product

Resources

About