1997
DOI: 10.1016/s0377-2217(96)00248-2
|View full text |Cite
|
Sign up to set email alerts
|

Designing paced assembly lines with fixed number of stations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
21
0
4

Year Published

2002
2002
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 47 publications
(25 citation statements)
references
References 20 publications
0
21
0
4
Order By: Relevance
“…Thus, we do without describing such models but refer to Scholl (1999, Chapter 2.2.1.2) where different models are presented. Moreover, see Ugurdag et al (1997), Pinnoi and Wilhelm (1997a), Bockmayr and Pisaruk (2001), and Peeters and Degraeve (this issue).…”
Section: Simple Assembly Line Balancing Problem (Salbp)mentioning
confidence: 95%
“…Thus, we do without describing such models but refer to Scholl (1999, Chapter 2.2.1.2) where different models are presented. Moreover, see Ugurdag et al (1997), Pinnoi and Wilhelm (1997a), Bockmayr and Pisaruk (2001), and Peeters and Degraeve (this issue).…”
Section: Simple Assembly Line Balancing Problem (Salbp)mentioning
confidence: 95%
“…The SALBP consists in assigning a set of operations to identical consecutive stations minimizing the number of stations required, subject to precedence constraints between operations and cycle time constraints. Many exact and heuristic approaches for SALBP were suggested in literature: Lagrange relaxation techniques [8], Branch and Bound algorithms [7,9,10], and heuristics and meta-heuristics [11][12][13]. This list is not exhaustive.…”
Section: Short Literature Reviewmentioning
confidence: 99%
“…The SALBP consists in assigning a set of operations to identical consecutive stations minimizing the number of stations required, subject to precedence (between operations) and cycle time constraints. The principal approaches used in the literature for SALBP are: Lagrange relaxation techniques (Aghezzaf and Artiba, 1995), Branch and Bound algorithms, see for example (van Assche and Herroelen, 1979;Ugurdag et al, 1997;Scholl and Klein, 1998), heuristics and meta-heuristics (Arcus, 1966;Helgeson and Birnie, 1961;Rekiek et al, 2001). A state-of-the-art is presented in Baybars (1986), Becker and Scholl (2006), Erel and Sarin (1998), Ghosh and Gagnon (1989) and Rekiek et al (2002).…”
Section: Literature Review and Previous Workmentioning
confidence: 99%