Eureka: A Hybrid System for Assembly Line Balancing

Thomas R. Hoffmann
Additional contact information
Thomas R. Hoffmann: Carlson School of Management, University of Minnesota, Minneapolis, Minnesota 55455

Management Science, 1992, vol. 38, issue 1, 39-47

Abstract: Numerous methods have been proposed for solution of the simple assembly line balancing (SALB) problem. This paper describes a branch and bound algorithm which in many cases is faster than the well-known Hoffmann heuristic technique to which it is related. It introduces a simple bounding rule which uses the concept of the "theoretical" minimum slack time to achieve rapid solutions. It is combined with the Hoffmann heuristic to develop an even more effective system for solving SALB problems. Timing results are given for a standard set of problems found in the literature. Since that set was solved in such a very short time, more challenging as well as more typical problems are explored and timing results presented. Benchmarking of the procedure is easier since implementation is on an eight-megahertz IBM AT with a math coprocessor, using the standard IBM PC Professional FORTRAN compiler.

Keywords: line balancing; branch and bound; microcomputer; heuristic (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (29)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.38.1.39 (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:ormnsc:v:38:y:1992:i:1:p:39-47

Access Statistics for this article

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