Leon and Ramamoorthy (1997) developed an adaptable problem-space-based search method. Part of that work included development of a lower bound and comparison of makespans using real-world data. In this note we improve their lower bound and show that the Leon and Ramamoorthy search method found better makespan solutions than their lower bound indicated, including some optimal makespans.
|Original language||English (US)|
|Number of pages||3|
|Journal||IIE Transactions (Institute of Industrial Engineers)|
|State||Published - 2001|
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering