Balancing reconfigurable machining lines via a set partitioning model

Abstract

International audienceWe consider the problem of constructing an optimal 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 sequence dependent set-up 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, for each workstation, solving a scheduling problem in order to find the sequence of operations which minimises the total set-up time. To do this, a dynamic programming algorithm is developed. Several preprocessing procedures are suggested to reduce the number of workstations. A set of exact algorithms are proposed to solve the obtained set partitioning type problem: a constraint generation, a branch and cut, and a parallel branch and cut algorithms. Our experimental investigation demonstrated that the proposed method achieves a significant improvement in CPU times over those required by a previous study that is based on a different model formulation, and also, that the proposed method is able to solve large-sized problem instances

New flexibility drivers for manufacturing, supply chain and service operations

“…Zhang, Vonderembse, and Lim (2003) analyse manufacturing flexibility through defining and analysing relationships among competence, capability and customer satisfaction. Related works can also be found in assembly line balancing (Battaïa and Dolgui 2013;Borisovsky, Delorme, and Dolgui 2014) and the supply chain flexibility literature (see further in this article).Supply chain flexibility includes system, process and product flexibility (Tang and Tomlin 2008; Wei 2012, 2015;Dolgui, Ivanov, and Sokolov 2018;Ivanov 2018). System flexibility is composed of strategy and structural components.…”

Heuristic Approach for a Combined Transfer Line Balancing and Buffer Allocation Problem Considering Uncertain Demand

“…Later, an ant colony algorithm [9] and a greedy randomized adaptive search [10] were proposed with a single objective combining the performance of line balancing and the number of stations and of machines. A set partitioning model-based approach was proposed by Borisovsky et al [11,12] to solve the problem. The aim was to minimize the number of machine tools.…”

Towards balanced clustering - part 1 (preliminaries)

“…5. balanced partitioning of algorithms [139]; 6. balanced manufacturing scheduling in manufacturing systems (e.g., assembly line balancing problems) [6,9,35,36,61,62,64,80];…”

“…Balancing processes play central roles in many theoretical and practical fields (Fig. 1) [9,10,12,31,35,36,40,54,56,61,91,93,110,120,129,134,139,150]. The corresponding balancing problems are basic ones in various engineering domains, for example: manufacturing systems, computing systems, power/electricity systems, radio engineering systems, communication systems, and civil engineering systems.…”