Finding optimal line balances with OptPack

Authors:
Francis J. Nourie;Enrique R. Venta
Affiliations:
Loyola University of Chicago, Chicago, IL 60611, USA;Loyola University of Chicago, Chicago, IL 60611, USA
Venue:
Operations Research Letters
Year:
1991

Citing 3
Cited 2

A comparative evaluation of heuristic line balancing techniques

Management Science
A survey of exact algorithms for the simple assembly line balancing problem

Management Science
Optimally balancing large assembly lines with `FABLE'

Management Science

Firing sequences backward algorithm for simple assembly line balancing problem of type 1

Computers and Industrial Engineering
A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes OptPack, a new algorithm for finding optimal solutions to assembly line balancing problems. Preliminary computational experience shows that the algorithm is significantly faster, on the benchmark literature problems, than Johnson's (1988) Fable, the fastest currently available algorithm. A microcomputer implementation of OptPack is also described and computational experience is reported.