This paper deals with the assignment of stations to operators into flexible manufacturing systems by minimizing the operators’ walking times over a given planning horizon. The manufacturing system is supposed to present a linear layout where the stations are aligned along a longitudinal axis. Stations are flexible (so that different jobs can be scheduled on the same station along the planning horizon) and may differ from each other in terms of degree of automation and, consequently, in terms of amount of human labor involved. Thus, two or more stations might share the same operator within the working shift and, consequently, the assignment of the optimal subset of stations to each operator is anything but trivial. Hence, a mixed-integer linear programming model is proposed which takes into account (and minimizes) the travel walking distances of the operators according to the assigned subset of stations. Other realistic constraints, such as the actual availability of the operators and the requirement stating that each scheduled job has to be assigned to a single operator for its entire duration, are included in the model. The validity of the model is proved by discussing a real-world case study from the plastic industry.
Minimizing operators’ walking times into a linear system layout / Gebennini, Elisa; Zeppetella, Luca; Grassi, Andrea; Rimini, Bianca. - ELETTRONICO. - 49:12(2016), pp. 1709-1714. (Intervento presentato al convegno 8th IFAC Conference on Manufacturing Modelling, Management and Control (MIM) tenutosi a Troyes, FRANCE nel JUN 28-30, 2016) [10.1016/j.ifacol.2016.07.828].
Minimizing operators’ walking times into a linear system layout
GEBENNINI, Elisa;ZEPPETELLA, LUCA;GRASSI, Andrea;RIMINI, Bianca
2016
Abstract
This paper deals with the assignment of stations to operators into flexible manufacturing systems by minimizing the operators’ walking times over a given planning horizon. The manufacturing system is supposed to present a linear layout where the stations are aligned along a longitudinal axis. Stations are flexible (so that different jobs can be scheduled on the same station along the planning horizon) and may differ from each other in terms of degree of automation and, consequently, in terms of amount of human labor involved. Thus, two or more stations might share the same operator within the working shift and, consequently, the assignment of the optimal subset of stations to each operator is anything but trivial. Hence, a mixed-integer linear programming model is proposed which takes into account (and minimizes) the travel walking distances of the operators according to the assigned subset of stations. Other realistic constraints, such as the actual availability of the operators and the requirement stating that each scheduled job has to be assigned to a single operator for its entire duration, are included in the model. The validity of the model is proved by discussing a real-world case study from the plastic industry.File | Dimensione | Formato | |
---|---|---|---|
Published.pdf
Accesso riservato
Descrizione: Full text
Tipologia:
Versione pubblicata dall'editore
Dimensione
1.13 MB
Formato
Adobe PDF
|
1.13 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris