Beam search algorithms for the early/tardy scheduling problem with release dates

• Type: Article in International Scientific Journal
• Date: 2005

Authors

Valente, JMS (Author) FEP; Alves, RAFS (Author) FEP

Journal

Title: Journal of Manufacturing Systems

Vol. 24

Pages: 35-46

ISSN: 0278-6125

Publisher: Elsevier

Indexing

ISI Web of Knowledge - 7 Citations

ISI Web of Science

Scopus - 5 Citations

Scientific classification

FOS: Engineering and technology > Civil engineering

CORDIS: Social sciences > Economics > Management studies

Other information

Authenticus ID: P-000-636

DOI: 10.1016/s0278-6125(05)80005-6

Abstract (EN): This paper presents several beam search algorithms for the single-machine earliness/tardiness scheduling problem with release dates and no unforced idle time. These algorithms include classical beam search procedures, with both priority and total cost evaluation functions, as well as the filtered and recovering variants. Both priority evaluation functions and problem-specific properties were considered for the filtering step used in the filtered and recovering procedures. The computational results show that the recovering beam search algorithms outperform their filtered counterparts, while the priority-based filtering procedure proves superior to the rules-based alternative. The beam search procedure with a total cost function provides very good results but is computationally expensive. The recovering algorithm is quite close in solution quality and is significantly faster, so it can be used to solve even large instances.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 12