Optimisation of multi-position machines and transfer lines

Dolgui, Alexandre; Guschinsky, Nikolaï; Levin, Genrikh; Proth, Jean‐Marie

doi:10.1016/j.ejor.2006.03.069

Cited by 46 publications

(21 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Some dominance rules were developed to reduce the size of the obtained graph. More recent results on this method are given in Dolgui et al (2006b). (b) A mixed integer programming (MIP) approach was developed in Dolgui et al (2000) dealing with the special cases 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: Literature Review and Previous Workmentioning

confidence: 99%

“…The shortest path method was initially suggested in Dolgui et al (2000), for more recent version see Dolgui et al (2006b). Let P be a set of collections P ¼ ffN 11 ; .…”

Section: Resolution Of Sub-problemsmentioning

confidence: 99%

“…The algorithm developed in Dolgui et al (2000Dolgui et al ( , 2006b finds a shortest constrained path in digraph H, i.e. a path x opt with the minimal cost such that m(x) 6 m 0 and j k À j kÀ1 6 n 0 for k ¼ 1; .…”

Section: Resolution Of Sub-problemsmentioning

confidence: 99%

See 2 more Smart Citations

A heuristic multi-start decomposition approach for optimal design of serial machining lines

Guschinskaya

Dolgui

Guschinsky

et al. 2008

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

Section: Literature Review and Previous Workmentioning

confidence: 99%

“…The shortest path method was initially suggested in Dolgui et al (2000), for more recent version see Dolgui et al (2006b). Let P be a set of collections P ¼ ffN 11 ; .…”

Section: Resolution Of Sub-problemsmentioning

confidence: 99%

See 1 more Smart Citation

A heuristic multi-start decomposition approach for optimal design of serial machining lines

Guschinskaya

Dolgui

Guschinsky

et al. 2008

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

“…An improved version of MIP model with some pre-processing rules and cuts is presented by Dolgui et al (2006a). A more recent version of the graph approach is given by Dolgui et al (2006c). These exact optimization methods can be used only for small and medium-sized problems (*60 operations).…”

Section: Introductionmentioning

confidence: 99%

A random search and backtracking procedure for transfer line balancing

Finel

Dolgui

Vernadat

2008

International Journal of Computer Integrated Manufacturing

Self Cite

View full text Add to dashboard Cite

The optimal logical layout design for a type of machining transfer lines is addressed. Such transfer lines are made of many machine-tools (workstations) located in sequence. On each workstation there are several spindle-heads. A spindle-head does not execute a single operation but a block of machining operations; all operations of a block are executed simultaneously (in parallel). Spindle-heads of the same workstation are activated sequentially in a fixed order. The transfer line design problem considered in the paper consists of finding the best partition in blocks and workstations of the set of all operations to be executed on the line. The objective is to minimize the number of spindle-heads and workstations (i.e. transfer line investment cost). An optimal decision must satisfy a desired productivity rate (cycle time) as well as precedence and compatibility constraints for machining operations. A heuristic algorithm is proposed: it is based on the COMSOAL technique and a backtracking approach. Results from computer testing are reported.

show abstract

“…The configuration of semi-automated systems with a multi-turn rotary table was discussed in Battini et al (2007). Mathematical models of transfer machines with rotary or mobile tables were proposed in Guschinskaya Dolgui et al (2008), ), and Battaïa et al, (2012a, 2012b. Unfortunately, the principal advantage introduced by the use of turrets, the possibility of serial-parallel machining, cannot be taken into account by these models where only machining modules activated in series or in parallel are considered.…”

Section: Introductionmentioning

confidence: 99%

Combinatorial techniques to optimally customize an automated production line with rotary transfer and turrets

Battaïa¹,

Dolgui²,

Guschinsky

et al. 2014

IIE Transactions

View full text Add to dashboard Cite

A problem of design of complex automated production lines with rotary transfer and turrets is considered. Operations are partitioned into groups that 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 of minimizing the estimated cost of this automated production line, while reaching a given cycle time and satisfying all constraints. Two methods are proposed to solve the problem. The first uses a mixed-integer programming formulation of the problem. The second method is based on its reduction to a constrained shortest path problem. An industrial example is presented.

show abstract

Optimisation of multi-position machines and transfer lines

Cited by 46 publications

References 16 publications

A heuristic multi-start decomposition approach for optimal design of serial machining lines

A heuristic multi-start decomposition approach for optimal design of serial machining lines

A random search and backtracking procedure for transfer line balancing

Combinatorial techniques to optimally customize an automated production line with rotary transfer and turrets

Contact Info

Product

Resources

About