An adaptable problem-space-based search method for flexible flow line scheduling

M. E. Kurz, Ronald Askin

Research output: Contribution to journalArticle

13 Scopus citations

Abstract

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 languageEnglish (US)
Pages (from-to)691-693
Number of pages3
JournalIIE Transactions (Institute of Industrial Engineers)
Volume33
Issue number8
DOIs
StatePublished - Aug 2001

    Fingerprint

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this