Finding optimal line balances with OptPack

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 availa...

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters 1991, Vol.10 (3), p.165-171
Main Authors: Nourie, Francis J., Venta, Enrique R.
Format: Article
Language:English
Subjects:
algorithm
Applied sciences
assembly line balancing
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Scheduling, sequencing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(91)90034-M