Performance analysis of beam search with look ahead

Suranjan De, Anita Lee-Post

Research output: Contribution to journalArticlepeer-review


This paper presents a heuristic search strategy called beam search and investigates its effectiveness by applying it to classical job shop scheduling problems. A look-ahead feature is incorporated in the strategy to detect potential resource conflicts. Benchmark problems and existing test cases are used in a performance analysis of the search strategy. The search strategy is implemented in a SUN SPARC station using Common-LISP. Our computational experience using this enhanced version of beam search on job shop scheduling problems are reported.

Original languageEnglish
Pages (from-to)209-218
Number of pages10
JournalJournal of Computing and Information Technology
Issue number4
StatePublished - 1997


  • Beam search
  • Heuristic search
  • Look-ahead
  • Scheduling

ASJC Scopus subject areas

  • Computer Science (all)


Dive into the research topics of 'Performance analysis of beam search with look ahead'. Together they form a unique fingerprint.

Cite this