A monolithic method of scheduling for assembly of multi-option products in hybrid flow shop systems
PDF (Polish)

Keywords

assembly systems, assembly scheduling, operating planning, integer programming

How to Cite

Magiera, M. (2017). A monolithic method of scheduling for assembly of multi-option products in hybrid flow shop systems. Technologia I Automatyzacja Montażu (Assembly Techniques and Technologies), 96(2), 13-18. Retrieved from https://journals.prz.edu.pl/tiam/article/view/1103

Abstract

The presented method is used to construction of the shortest assembly schedules of multi-option products. The specific characteristics of assembled products are regarded, for example additional elements (e.g. a handle), different parameters (e.g. a power of the engine), and other properties that determine appearance of a product (e.g. a color of a casing). Schedules are constructed for hybrid flow shop systems. This systems consist of assembly lines with parallel assembly machines. The intermediate buffers with limited capacity are located between assembly stages. In these buffers products are waiting to perform the next assembly operations. The unidirectional flow of multi-option products is regarded – for a  fixed or an alternative assembly routes. The monolithic (an one level) approach to construction of assembly schedule is used. The task of assignment of assembly operations to machines and task of scheduling are simultaneously solved. The shortest schedule is  fixed. The mathematical models of integer programming are constructed. A  fixed assembly routes and an alternative assembly routes are regarded in the mathematical models. The monolithic approach and the integer programming ensure the construction of an optimal schedule. The constructed structure of input parameters and variables and formulated mathematical relationships (constraints) regard multi-option products. There are basic operations (the same for the type of product) and additional operations (differentiating products of a specified type). The structure of input parameters and constraints, and structure of constraints formulated for mathematical models favourably affect the complexity of computing. The results of computational experiments with the proposed method are presented. These experiments have been carried out not only in order to verify the method, but also to make it possible to compare the length of schedules for the  fixed and the alternative routes.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/)

PDF (Polish)

References

Fourer R., D. Gay, B. Kernighan. 2003. “AMPL, A Modelling Language for Mathematical Programming”. Duxbury Press, Pacific Grove, CA.

Łunarski J. 2016. „Znaczenie informacji w procesach produkcyjnych”. Technologia i Automatyzacja Montażu (4): 4–5.

Magiera M. 2016. „Hierarchiczna metoda planowania przepływów wielowariantowych produktów przez linie produkcyjne” [w:] „Automatyzacja procesów dyskretnych. Teoria i zastosowania”. pod red. Świerniaka A., J. Krystek, Gliwice: Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego, tom I: 171–183.

Magiera M. 2017. „Monolityczna metoda planowania montażu dotyczącego wielowariantowego sprzętu elektrycznego i elektronicznego”. Przegląd Elektrotechniczny (w druku).

Magiera M. 2016. „Wybrane metody planowania przepływów produktów przez linie produkcyjne i łańcuchy dostaw”. Kraków: Wydawnictwa AGH.

Pindeo M.L. 2008. “Scheduling. Theory, Algorithms, and Systems”. New York: Springer.

Sawik T. 1999. “Production Planning and Scheduling in Flexible Assembly Systems”. Berlin: Springer-Verlag.

Schneeweiss Ch. 1999. “Hierarchies in Distributed Decision Making”. Berlin: Springer-Verlag.

www.gurobi.com (Gurobi Optimizer, dostęp 12.2016 r.).