Scheduling Of Mixed Model Assembly Lines Research Articles

Correction to: Anticipating technical car sequencing rules in the master production scheduling of mixed-model assembly lines

Correction to: Anticipating technical car sequencing rules in the master production scheduling of mixed-model assembly lines

Anticipating technical car sequencing rules in the master production scheduling of mixed-model assembly lines

In this paper, we propose a new linear programming-based approach that enables the consideration of technical car sequencing rules in the master production scheduling of mixed-model assembly lines at a much higher level of detail than previous approaches. To this end, we investigate certain interdependencies of car sequencing rules, which have largely been neglected, both in practice and in the research literature. We illustrate the existence and impact of these interdependencies and show that they induce additional implicit constraints, which can be represented by linear inequalities and incorporated into linear optimization models for master production scheduling. In a numerical study, we evaluate the approach and show, that it can significantly reduce sequencing violations compared to existing approaches.

Production scheduling problem of automobile mixed model assembly line

Nowadays, the mode of production has changed from mass production to multi variety and small batch production, and mixed model assembly line has emerged. Mixed model assembly is widely used in automobile enterprises. This paper summarizes the theory and method of automobile mixed model assembly line scheduling, analyzes its characteristics and difficulties, summarizes the related optimization objectives, and introduces the related algorithms, so as to make the scheduling problem of mixed model assembly line more clear.

Manufacturer Oriented Mixed Model Assembly Line Scheduling using Dynamic Programming

Assembly lines have very important role in manufacturing. These are used to manufacture large scale series of products. Developments over the period of time changed the assembly lines from single model lines to more convenient systems with some variations including two assembly lines, ‘n’ assembly lines, customer oriented mixed model, multi model and u shaped lines and many more. In this paper attention is focused to develop the model which is used to assemble the three different types of autos which have some common auto parts. The main objective is to design this model to reduce the time when the different types of autos having some common auto parts are assembled. The optimization problem in this paper is solved by using dynamic programming approach. For this purpose six assembly lines are used having ‘n’ number of stations, two assembly lines are specified for each type of auto. Assembly lines are set in such a way that the common auto part of three types must be assembled at the parallel station of the lines

Level scheduling of mixed-model assembly lines under storage constraints

In a mixed-model assembly line, different models of a common base product can be manufactured in intermixed production sequences. A famous solution approach for the resulting short-term sequencing problem is the so-called level scheduling problem, which aims at evenly smoothing the material requirements over time in order to facilitate a just-in-time supply. However, if materials are delivered in discrete quantities, the resulting spread of material usages implies that issued cargo carriers of a respective material remain at a station for a longer period of time. In practical applications with many materials required per station, this procedure might lead to bottlenecks with respect to the scarce storage space at stations. This paper investigates level scheduling under the constraint that the induced part usage patterns may not violate given storage constraints. The resulting sequencing problem is formalised and solved by suitable exact and heuristic solution approaches.

Mixed-Model Assembly Line Scheduling in Consideration of Idle Time and Line Stops.

Mixed-Model Assembly Line Scheduling in Consideration of Idle Time and Line Stops.

Multi-agent systems in production planning and control: An application to the scheduling of mixed-model assembly lines

This work deals with production smoothing, one of the keys of success of Just In Time and Lean Production. By levelling the load of the workstations, production smoothing allows a regular material flow, shorter manufacturing lead times, and lower work in process. Different solutions to the mixed-model assembly lines sequencing problem have been proposed in literature. In this paper, a Multi-Agent System is presented, which solves this problem according to the theory of autonomous agents. The experimental results show that this innovative approach has a good performance if compared with the traditional ones.

Mixed-model assembly line scheduling using the Lagrangian relaxation technique

The increasing market demand for product variety forces manufacturers to design mixed-model assembly lines on which different product models can be switched back and forth and mixed together with little changeover costs. This paper describes the design and implementation of an optimization-based scheduling algorithm for mixed-model compressor assembly lines at Toshiba with complicated component supply requirements. A separable integer optimization formulation is obtained by treating compressor lots going through a properly balanced line as undergoing a single operation, and the scheduling goal is to delivery products just in time while avoiding possible component shortage. The problem is solved b y using Lagrangian Relaxation (LR). Several generic defects of LR leading to slow algorithm convergence are identified based on geometrical insights, and are overcome by perturbing/ changing problem parameters. Numerical testing shows that near-optimal schedules are efficiently obtained, convergence is significantly improved, and the method is effective for practical problems. The system is currently under deployment at Toshiba

Mixed-Model Assembly Line Scheduling in Consideration of Assembly Time.

In a mixed-model assembly line problem, two objectives has been proposed to decide the product scheduling. One is to minimize the work congestion and the other is keeping the consumption rate of each part. In JIT production system, the latter one is more important, so the goal chasing method (GC) has been prposed to achieve this goal. The difference of assembly time among each product was not cnsidered in any solution algorithms. Recently, the time based goal chasing method (TBGC) has been proposed in which the different assembly time among each product is considered. The good point of TBGC is able to consider the idle time contained in an assembly line. However, TBGC is only applied to a single work station problem. In this paper, TBGC is applied to an assembly line and numerical experiments are presented.

Expert system mixed-model assembly line scheduling

Abstract Consumer demand for variety forces manufacturers to produce models in families that can be adapted to include optional features. Scheduling assembly lines to produce these models is a complex task that requires the satisfaction of numerous constraints, such aa model selection and sequencing, lot sizes, models complexity, line interdependencies, lines capacity, and line changeover cost. This paper describes an expert system scheduler that uses a conflict resolution procedure driven by component changeover costs, intraline and interline constraints, and a set of heuristics that affect the production of the whole factory. Base models and their components are represented by object-oriented methods; rules accessing objects create production plans by resolving conflicts arising from the interactions between the numerous constraints. The resulting plans are then used to set up the production in the lines and to provide feedback to manufacturing and marketing.