A beam search-based algorithm and evaluation of scheduling approaches for flexible manufacturing systems

Creative Commons License

Sabuncuoglu İ., Karabuk S.

IIE TRANSACTIONS, vol.30, no.2, pp.179-191, 1998 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 30 Issue: 2
  • Publication Date: 1998
  • Doi Number: 10.1080/07408179808966449
  • Journal Name: IIE TRANSACTIONS
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.179-191
  • Abdullah Gül University Affiliated: No


This paper presents a new algorithm for the flexible manufacturing system (FMS) scheduling problem. The proposed algorithm is a heuristic based on filtered beam search. It considers finite buffer capacity, routing and sequence flexibilities and generates machine and automated guided vehicle (AGV) schedules for a given scheduling period. A new deadlock resolution mechanism is also developed as an integral part of the proposed algorithm. The performance of the algorithm is compared with several machine and AGV dispatching rules using mean flow time, mean tardiness and makespan criteria. It is also used to examine the effects of scheduling factors (i.e., machine and AGV load levels, routing and sequence flexibilities, etc.) on the system performance. The results indicate that the proposed scheduling algorithm yields considerable improvements in system performance over dispatching rules under a wide variety of experimental conditions.