Balancing Reconfigurable Machining Lines by Means of Set Partitioning Model

Abstract : We consider the problem of construction of an optimal reconfigurable machining line as a sequence of workstations performing specific sets of operations. The line is required to satisfy the given precedence order on operations, inclusion, exclusion and accessibility constraints. The cycle times of workstations are computed taking into account the processing and setup times of operations and must not exceed the given bound. For solving the problem, we propose a reduction of this machining line design problem to a set partitioning type problem. This approach implies generating all possible workstations and finding optimal sequence of operations in each workstation. To do this, a dynamic programming algorithm is developed. Several preprocessing procedures are suggested for reducing the number of workstations. For solving the obtained set partitioning type problem, a constraint generation algorithm based on mixed integer programming model is proposed.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Florent Breuil <>
Submitted on : Thursday, May 3, 2012 - 11:21:27 AM
Last modification on : Monday, January 14, 2019 - 12:08:18 PM



Pavel Borisovsky, Xavier Delorme, Alexandre Dolgui. Balancing Reconfigurable Machining Lines by Means of Set Partitioning Model. 14th IFAC Symposium on Information Control Problems in Manufacturing (INCOM12), May 2012, Bucharest, Romania. pp 426-431, ⟨10.3182/20120523-3-RO-2023.00354⟩. ⟨emse-00693963⟩



Record views