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

A special case of transfer lines balancing by graph approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
24
0
7

Year Published

2006
2006
2015
2015

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 67 publications
(31 citation statements)
references
References 8 publications
0
24
0
7
Order By: Relevance
“…Battaïa and Dolgui, 2013;Bukchin and Tzur, 2000;Bukchin and Rubinovitz, 2003;Dolgui, Guschinsky and Levin, 2006;Dolgui, Guschinsky and Levin, 2009;Kara et al, 2011;Terkaj, Tolio and Valente 2009). Most close to the problem in question are line balancing problems with equipment selection (Bukchin and Tzur, 2000;Bukchin and Rubinovitz, 2003;Kara et al, 2011), when operating modes are selected from the finite set.…”
Section: Introductionmentioning
confidence: 99%
“…Battaïa and Dolgui, 2013;Bukchin and Tzur, 2000;Bukchin and Rubinovitz, 2003;Dolgui, Guschinsky and Levin, 2006;Dolgui, Guschinsky and Levin, 2009;Kara et al, 2011;Terkaj, Tolio and Valente 2009). Most close to the problem in question are line balancing problems with equipment selection (Bukchin and Tzur, 2000;Bukchin and Rubinovitz, 2003;Kara et al, 2011), when operating modes are selected from the finite set.…”
Section: Introductionmentioning
confidence: 99%
“…The Branch and Bound algorithm is one of the heuristic techniques which has the longest history of application in the line balancing problem [14][15][16]. Other heuristic techniques, such as simulated annealing [17,18], tabu search [19], and graphical method [20], have also been applied more recently. The rise of artificial intelligent (AI) computational techniques in early 1990s has proved its value in line balancing control.…”
Section: Introductionmentioning
confidence: 99%
“…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%