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

Published Online:https://doi.org/10.1287/mnsc.39.10.1190

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

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.