Skip to the main content

Journal of computing and information technology, Vol. 5 No. 4, 1997.

Original scientific paper

Performance Analysis of Beam Search with Look Ahead

Suranjan De ; A. Gary Anderson Graduate School of Management, University of California, Riverside, USA
Anita Lee-Post ; Decision Science & Information Systems Area, School of Management, Gatton College of Business & Economics, University of Kentucky, Lexington, USA

Full text: english pdf 4.076 Kb

page 209-218

downloads: 590

cite

Abstract

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.

Keywords

Scheduling; Heuristic Search; Beam Search; Look-ahead

Hrčak ID:

150247

URI

https://hrcak.srce.hr/150247

Publication date:

30.12.1997.

Visits: 895 *