Microcomputer performance of ‘FABLE’ on Hoffmann’s data sets

Microcomputer performance of ‘FABLE’ on Hoffmann’s data sets

0.00 Avg rating0 Votes
Article ID: iaor19941886
Country: United States
Volume: 39
Issue: 10
Start Page Number: 1190
End Page Number: 1191
Publication Date: Oct 1993
Journal: Management Science
Authors:
Keywords: scheduling, optimization
Abstract:

Some of the legitimacy of Hoffmann’s Eureka is gained from his statement that ‘Eureka...would seem to be approximately six times as fast (as Johnson’s 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.’

Reviews

Required fields are marked *. Your email address will not be published.