Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search

James H. Patterson and Joseph J. Albracht
Additional contact information
James H. Patterson: The Pennsylvania State University, University Park, Pennsylvania
Joseph J. Albracht: RCA Solid State, Sommerville, New Jersey

Operations Research, 1975, vol. 23, issue 1, 166-172

Abstract: This paper presents a zero-one integer-programming formulation of the assembly line balancing (ALB) problem. Results indicate that this formulation requires as few as 50 to 60 percent of the number of variables required by other zero-one formulations of the ALB problem now in existence. Once formulated, problems are solved by examining a sequence of 0-1 programming problems for feasible solutions. Full advantage is taken of the structure of the 0-1 programs in determining feasibility. Computational results demonstrate the efficacy of the approach.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.1.166 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:23:y:1975:i:1:p:166-172

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().