Note: Microcomputer Performance of "FABLE" on Hoffmann's Data Sets

Roger V. Johnson
Additional contact information
Roger V. Johnson: School of Business Administration, University of Michigan, Ann Arbor, Michigan 48109-1234

Management Science, 1993, vol. 39, issue 10, 1190-1192

Abstract: Some of the legitimacy of Hoffmann's (1992) Eureka is gained from his statement that "Eureka ... would seem to be approximately six times as fast (as Johnson's (1988) FABLE on the literature set). However, Eureka had one problem for which its solution was one station over the optimal, whereas FABLE's solutions were all optimal."

Keywords: assembly line balancing; optimization; branch-and-bound (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.39.10.1190 (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:39:y:1993:i:10:p:1190-1192

Access Statistics for this article

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