| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 722659 | IFAC Proceedings Volumes | 2007 | 6 Pages |
Abstract
A known-optimal solution benchmark data set consisting of varying-size instances has been formulated for use in the evaluation and analysis of heuristics used to solve the disassembly line balancing problem. These scalable instances are easily modified to allow for consideration of larger or smaller workstation cycle times (or bin sizes) and also have application to assembly line balancing problems and to the general class of bin-packing problems.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Seamus M. McGovern, Surendra M. Gupta,