Scheduling just-in-time part supply for mixed-model assembly lines

Boysen, Nils; Bock, Stefan

doi:10.1016/j.ejor.2010.10.029

Cited by 57 publications

(28 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Boysen and Bock (2011) investigated the problem of just-in-time part supply at a German manufacturer of luxury cars. They consider an in-house part supply problem where parts are stored in a central storage system and supplied to stations arranged in a segmented U-shaped assembly system.…”

Section: Literature Reviewmentioning

confidence: 99%

Part feeding at high-variant mixed-model assembly lines

et al. 2011

View full text Add to dashboard Cite

The part feeding problem at automotive assembly plants deals with the timely supply of parts to the designated stations at the assembly line. According to the just-in-time principle, buffer storages at the line are frequently refilled with parts retrieved from a central storage area. In the industrial application at hand, this is accomplished by means of an internal shuttle system which supplies the various stations with the needed parts based on a given assembly sequence. The main objective is to minimize the required number of shuttle drivers. To solve this inhouse transportation problem, a heuristic solution procedure is developed which is based on the decomposition of the entire planning problem into two stages. First, transportation orders are derived from the given assembly sequence. In the second stage, these orders are assigned to tours of the shuttle system taking transportation capacity restrictions, due dates and tour scheduling constraints into account. Numerical results show that the proposed heuristic solves even large-sized problem instances in short computational time. Benchmark comparisons with Kanban systems reveal the superiority of the proposed predictive part feeding approach.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Part feeding at high-variant mixed-model assembly lines

et al. 2011

View full text Add to dashboard Cite

show abstract

“…Additionally, due to the complexity of the problem, a heuristic that consisted of a greedy randomized adaptive search procedure was developed. Boysen and Bock [12] studied the delivery of bulk containers to mixedmodel assembly lines. These authors tried to schedule just-intime (JIT) part supply and determined a model for sequencing boxes to feed the assembly line.…”

Section: Literature Reviewmentioning

confidence: 99%

A novel memetic ant colony optimization-based heuristic algorithm for solving the assembly line part feeding problem

Fathi

Rodríguez

Álvarez

2014

Int J Adv Manuf Technol

View full text Add to dashboard Cite

In recent years, part feeding at assembly lines has become a critical issue as the result of a high level of product customization. The assembly line part feeding problem is a complex problem in which a number of decisions should be made in order to select the right quantity of each part to be supplied at the right time under a set of constraints. This study aims to cope with the part feeding problem at assembly lines by introducing a new memetic ant colony optimization-based heuristic algorithm. Due to the novelty of the problem and in order to evaluate the performance of the proposed memetic algorithm, a mathematical formulation is also presented. Case data from an automobile manufacturer and a set of generated instances are used to test both the mathematical model and the proposed memetic algorithm. The results reveal that although it is computationally difficult to solve the problem using the exact mathematical model, the mimetic algorithm was able to find sufficiently good solutions in a short period of time.

show abstract

“…An ILP model is used to solve this problem. The part supply scheduling problem in line-integrated supermarkets with the workforce minimization criterion and no stock out constraint is studied by Boysen and Emde [15]. The authors use a heuristic decomposition approach to solve this problem and draw important conclusions for managers.…”

Section: Literature Reviewmentioning

confidence: 99%

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

Scheduling just-in-time part supply for mixed-model assembly lines

Cited by 57 publications

References 23 publications

Part feeding at high-variant mixed-model assembly lines

Part feeding at high-variant mixed-model assembly lines

A novel memetic ant colony optimization-based heuristic algorithm for solving the assembly line part feeding problem

Optimal workforce assignment to operations of a paced assembly line

Contact Info

Product

Resources

About