1971
DOI: 10.1080/05695557108974787
|View full text |Cite
|
Sign up to set email alerts
|

Assembly Line Balancing by Zero-One Integer Programming

Abstract: In presenting the dissertation as a partial fulfillment of the requirements for an advanced degree from the Georgia Institute of Technology, I agree that the Library of the Institute shall make it available for inspection and circulation in accordance with its regulations governing materials of this type. I agree that permission to copy from, or to publish from, this dissertation may be granted by the professor under whose direction it was written, or, in his absence, by the Dean of the Graduate Division when … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0
1

Year Published

1976
1976
2011
2011

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 51 publications
(13 citation statements)
references
References 13 publications
0
12
0
1
Order By: Relevance
“…Ghosh en Gagnon [9] beskryf die SALBP (Simple Assembly-Line Balancing Problem) waar die balanseringsprobleem opgelos word deur sekere vereenvoudigende aannames te maak. Spesiale gevalle wat uit die SALBP volg, word byvoorbeeld deur Bowman [3], Patterson en Albracht [17], en Thangavelu en Shetty [24] gemodelleer en opgelos.…”
Section: Literatuurunclassified
“…Ghosh en Gagnon [9] beskryf die SALBP (Simple Assembly-Line Balancing Problem) waar die balanseringsprobleem opgelos word deur sekere vereenvoudigende aannames te maak. Spesiale gevalle wat uit die SALBP volg, word byvoorbeeld deur Bowman [3], Patterson en Albracht [17], en Thangavelu en Shetty [24] gemodelleer en opgelos.…”
Section: Literatuurunclassified
“…Improvements on White's model were also introduced in the constraints of the problem. Here again Thangavelu and Shetty (1971) have replaced the precedence constraints by:…”
Section: Precedence Constraintsmentioning
confidence: 99%
“…Most models formulate the problem for a single last task, that is, only one index belongs to L (see for example [11]). If several final tasks exist (see the following sample problem) then a dummy task is used which directly succeeds the real final tasks.…”
Section: Decision Variablesmentioning
confidence: 99%
“…White modified Bowman's IP model and defined 0-1 decision variables for the problem [12]. Since ALB models are NP hard the research focused on reducing the number of variables and constraints in order to reduce the complexity of the models (see for example [1,10,11]). …”
Section: Introductionmentioning
confidence: 99%