On problem of optimal design of transfer lines with parallel and sequential operations

A MIP approach for balancing transfer line with complex industrial constraints

“…It was first mentioned in Szadkowski (1997). Then, in Dolgui, Guschinsky, and Levin (1999), it was defined for dedicated transfer lines and called the transfer line balancing problem (TLBP). In most of the works that consider these transfer line balancing problems, the lines are equipped by multi-spindle heads machines.…”

“…Several exact and approximate methods for TLBP have been presented. The most significant methods for an exact resolution of the TLBP are (i) linear programming for the logical layout design of modular machining lines (Belmokhtar, Dolgui, Guschinsky, & Levin, 2006), a dynamic programming (Dolgui et al, 1999) and a mixed integer approach (Dolgui, Finel, Guschinsky, Levin, & Vernadat, 2006) to balancing machining lines with blocks of parallel operations, (ii) a Branch and Bound procedure for a design problem of transfer lines composed of workstations with sequentially activated multi-spindle heads (Dolgui & Ihnatsenka, 2009). For large scale problems, several approximate methods have been designed: (i) priority rules heuristics (Finel, Dolgui, & Vernadat, 2008;Guschinskaya, Dolgui, Guschinsky, & Levin, 2008) and (ii) metaheuristics, for example, see Dolgui, Guschinskaya, and Eremeev (2008), a GRASP method and a genetic algorithm have been proposed for the transfer lines balancing problem.…”

Balancing lines with CNC machines: A multi-start ant based heuristic

“…It was defined in [14] for dedicated transfer lines and first called transfer line balancing problem (TLBP). Industry favors solving TLBP because the machining lines become too expensive otherwise.…”

“…Dynamic programming: a recursive method used for the resolution of problems having an additive objective function. The examples of this approach for TLBP are given in [14], where the initial problems were transformed into constrained shortest path problems and solved with appropriate algorithms. Branch and Bound: an implicit enumerative procedure which avoids verifying all solutions.…”

Modular Machining Line Design and Reconfiguration: Some Optimization Methods

“…The closest problems are studied in Dolgui et al (1999), , Dolgui et al (2001), Dolgui et al (2005) and Dolgui et al (2006b) where all blocks at the same station are executed sequentially (block by block) and any alternative variants of blocks are not given beforehand (any subset of the given operation set is a potential block). In Dolgui et al (2004), Belmokhtar et al (2004), Dolgui et al (2006a) the blocks are known and are executed in parallel.…”