2006
DOI: 10.1016/j.cie.2006.08.010
|View full text |Cite
|
Sign up to set email alerts
|

Integer programming models for logical layout design of modular machining lines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
10
0
8

Year Published

2007
2007
2019
2019

Publication Types

Select...
7
3

Relationship

5
5

Authors

Journals

citations
Cited by 41 publications
(19 citation statements)
references
References 23 publications
1
10
0
8
Order By: Relevance
“…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 et al 2006), (ii) dynamic programming (Dolgui et al 1999) and a mixed-integer approach for balancing machining lines with blocks of parallel operations, and (iii) a branch-and-bound procedure for a design problem of transfer lines composed of stations with sequentially activated multi-spindle heads (Dolgui and Ihnatsenka 2009). For large-scale problems, several approximate methods have been designed: (i) priority rules heuristics (Finel et al 2008;Guschinskaya et al 2008) and (ii) metaheuristics, with a GRASP and a genetic algorithm proposed by Dolgui et al (2008) for the transfer lines balancing problem.…”
Section: Related Workmentioning
confidence: 99%
“…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 et al 2006), (ii) dynamic programming (Dolgui et al 1999) and a mixed-integer approach for balancing machining lines with blocks of parallel operations, and (iii) a branch-and-bound procedure for a design problem of transfer lines composed of stations with sequentially activated multi-spindle heads (Dolgui and Ihnatsenka 2009). For large-scale problems, several approximate methods have been designed: (i) priority rules heuristics (Finel et al 2008;Guschinskaya et al 2008) and (ii) metaheuristics, with a GRASP and a genetic algorithm proposed by Dolgui et al (2008) for the transfer lines balancing problem.…”
Section: Related Workmentioning
confidence: 99%
“…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.…”
Section: Related Workmentioning
confidence: 99%
“…An other relevant engineering optimization area that focuses on equipment selection is transfer line balancing [Belmokhtar et al, 2006, Dolgui et al, 2006c, Battaia and Dolgui, 2012, Borisovsky et al, 2012, Delorme et al, 2012. In these systems, stations can be equipped with changeable units such as spindle heads.…”
Section: Cost Based Modelsmentioning
confidence: 99%