A heuristic approach for transfer lines balancing

Dolgui, Alexandre; Finel, Brigitte; Vernadat, François; Guschinsky, Nikolaï; Levin, Genrikh

doi:10.1007/s10845-004-5886-6

Cited by 63 publications

(42 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The algorithms named SAO (Sequential Assignment of Operations) are modifications of heuristics (Dolgui et al, 2005). At each iteration, an algorithm creates machining modules of current position step by step.…”

Section: Heuristicsmentioning

confidence: 99%

Heuristics for Batch Machining at Reconfigurable Rotary Transfer Machines

Battaïa

Dolgui²,

Guschinsky

2016

IFAC-PapersOnLine

View full text Add to dashboard Cite

A problem of design of reconfigurable rotary transfer machines is considered. Parts are divided into batches. Parts of a batch are located at the loading position of rotary table in a given sequence and they are processed simultaneously. Operations are partitioned into groups which are performed by spindle heads or by turrets. Constraints related to the design of spindle heads, turrets, and working positions, as well as precedence constraints related to operations, are given. The problem consists in minimizing the estimated cost of the transfer machine, while reaching a given output and satisfying all the constraints. The proposed methods to solve the problem are based on sequential assignment of operations to machining modules. Experimental results with different heuristics are reported.Keywords: Computer-aided design, machining, optimization, heuristics.  INTRODUCTIONIn large serial production machining systems composed of multi-purpose and multi-position equipment with sufficiently high concentration of manufacturing operations in working positions are used. These manufacturing systems provide high productivity and working accuracy resulting in increased manufacturing efficiency. Nevertheless, the trend in today's market place requires more flexible and adaptive manufacturing systems (Makssoud et al., 2014(Makssoud et al., , 2015. A possible solution is to employ reconfigurable manufacturing systems (RMS). RMS are able to manufacture different types of products by batches without losing all other advantages of large series production systems. This paper deals with a problem of the optimal design of a reconfigurable rotary transfer machine with turrets for parallel machining of multiple parts. Such a machine is multipositional, i.e. parts are sequentially machined on m 0 (1, 2, …, m 0 ) working positions. One position of the machine (zero) is exclusively used for loading new billets and unloading finished parts. At each working position, several machining modules (spindle heads) can be installed to process the operations assigned to this position. They are activated sequentially or simultaneously. Sequential activation is realized by the use of turrets. Simultaneous activation is possible if machining modules are related to the different sides of the part and work in parallel. Horizontal and vertical spindle heads and turrets can be used to access to different sides of parts on a working position.We consider the case where only one vertical turret can be mounted at the machine or one spindle head common for all working positions. Several horizontal spindle heads and turrets can be used. However, there is only one horizontal spindle head or turret per position. Different parts are loaded in a given sequence and they are processed simultaneously by corresponding machining modules. When machining at all working positions is finished, the rotary table turns and the machining modules of turrets are changed (if necessary) in accordance with the part to be machined on that position. Since different parts a...

show abstract

Section: Heuristicsmentioning

confidence: 99%

Heuristics for Batch Machining at Reconfigurable Rotary Transfer Machines

Battaïa

Dolgui²,

Guschinsky

2016

IFAC-PapersOnLine

View full text Add to dashboard Cite

show abstract

“…The random search algorithm named FSIC (First Satisfy Inclusion Constraints) was suggested in (Dolgui et al, 2005). It deals with the special case of TLBP where all the operation times are given in advance (before grouping into blocks) and the block processing time is equal to the time of its longest operation.…”

Section: General Schemementioning

confidence: 99%

“…• heuristic algorithms RAP and FSIC were suggested in (Dolgui et al, 2005). These heuristics are based on the COMSOAL method (Arcus, 1966), i.e.…”

Section: Introductionmentioning

confidence: 99%

A Transfer Line Balancing Problem by Heuristic Methods: Industrial Case Studies

Guschinskaya

Dolgui

2008

dmms

View full text Add to dashboard Cite

Abstract. The paper deals with the problem of optimal configuration of a type of transfer lines which are equipped with transfer machines. Such machines perform operations with standard modular spindle heads which are activated sequentially. All operations assigned to the same spindle head (block of operations) are executed simultaneously by a set of tools fixed at the spindle head. The quantity of machines and spindle heads used to produce a part with the given productivity rate defines the final cost of the transfer line which must be minimized. To minimize this cost, a combinatorial problem of operations assignment to blocks and machines must be solved. The solution must provide a desired productivity (cycle time), it must also satisfy precedence and compatibility constraints. In this paper, we suggest improved versions of FSIC heuristic algorithm in order to help line designers to solve real-scale industrial problems. Results of computational experiments obtained for industrial cases are presented.

show abstract

“…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.…”

Section: Related Literaturementioning

confidence: 99%