Balancing of Transfer Lines with Simultaneously Activated Spindles

Dolgui, Alexandre; Guschinsky, Nikolaï; Levin, Genrikh; Louly, Mohamed Aly Ould; Belmokhtar, Sana

doi:10.1016/s1474-6670(17)36096-2

Cited by 7 publications

(6 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, we carry out a comprehensive set of experimental tests for these algorithms as well as for the improved exact MIP and graph models. Some preliminary results, in relation to the proposed methods here, were presented in our communications at the conference (Dolgui et al, 2005c). Additional experimental results can be found in our working paper (Dolgui et al, 2005b).…”

Section: Introductionmentioning

confidence: 83%

Exact and heuristic algorithms for balancing transfer lines when a set of available spindle heads is given

Dolgui¹,

Guschinsky²,

Levin³

2008

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

A balancing problem for paced tandem transfer lines with several spindle heads at each station is considered. A spindle head executes a block of operations. The set of all available spindle heads as well as the operations executed by each spindle head, the spindle head times and costs are known. There are operations with several spindle head candidates. The problem at the line design stage consists in the choice of spindle heads from the given set and their assignment to workstations. The goal is to minimize the line cost while satisfying the precedence, inclusion and exclusion constraints. An exact algorithm based on a mixed integer programming approach is developed. Two types of new heuristic algorithms are also suggested. One of them step‐by‐step assigns randomly spindle heads to a current workstation. The second uses depth‐first search techniques. Experimental results are reported.

show abstract

Section: Introductionmentioning

confidence: 83%

Exact and heuristic algorithms for balancing transfer lines when a set of available spindle heads is given

Dolgui¹,

Guschinsky²,

Levin³

2008

Int Trans Operational Res

Self Cite

View full text Add to dashboard Cite

show abstract

“…In Dolgui et al (2004), Belmokhtar et al (2004), Dolgui et al (2006a) the blocks are known and are executed in parallel. All these papers concern the case of a single product, for which three solving approaches have been proposed: a constrained shortest path; mixed integer programming (MIP); heuristics.…”

Section: Related Literaturementioning

confidence: 99%

Modular Machining Line Design and Reconfiguration: Some Optimization Methods

Belmokhtar¹,

Dolgui

2006

Manufacturing the Future

View full text Add to dashboard Cite

“…For this problem, two exact methods were developed. One of them (Dolgui et al, 2004a) uses a mixed integer programming (MIP) approach. The second method (Dolgui et al, 2003b) is based on transformation the initial problem into a constrained shortest path problem.…”

Section: Introductionmentioning

confidence: 99%