Welcome to the InfoSci Platform
Application and Evaluation of Bee-Based Algorithms in Scheduling: A Case Study on Project Scheduling

Application and Evaluation of Bee-Based Algorithms in Scheduling: A Case Study on Project Scheduling

Ayse Aycim Selam, Ercan Oztemel
Copyright: © 2018 |Pages: 23
ISBN13: 9781522529446|ISBN10: 1522529446|EISBN13: 9781522529453
DOI: 10.4018/978-1-5225-2944-6.ch002
Cite Chapter Cite Chapter

MLA

Selam, Ayse Aycim, and Ercan Oztemel. "Application and Evaluation of Bee-Based Algorithms in Scheduling: A Case Study on Project Scheduling." Handbook of Research on Applied Optimization Methodologies in Manufacturing Systems, edited by Ömer Faruk Yılmaz and Süleyman Tüfekçí, IGI Global, 2018, pp. 20-42. https://doi.org/10.4018/978-1-5225-2944-6.ch002

APA

Selam, A. A. & Oztemel, E. (2018). Application and Evaluation of Bee-Based Algorithms in Scheduling: A Case Study on Project Scheduling. In Ö. Faruk Yılmaz & S. Tüfekçí (Eds.), Handbook of Research on Applied Optimization Methodologies in Manufacturing Systems (pp. 20-42). IGI Global. https://doi.org/10.4018/978-1-5225-2944-6.ch002

Chicago

Selam, Ayse Aycim, and Ercan Oztemel. "Application and Evaluation of Bee-Based Algorithms in Scheduling: A Case Study on Project Scheduling." In Handbook of Research on Applied Optimization Methodologies in Manufacturing Systems, edited by Ömer Faruk Yılmaz and Süleyman Tüfekçí, 20-42. Hershey, PA: IGI Global, 2018. https://doi.org/10.4018/978-1-5225-2944-6.ch002

Export Reference

Mendeley
Favorite

Abstract

Scheduling is a vital element of manufacturing processes and requires optimal solutions under undetermined conditions. Highly dynamic and, complex scheduling problems can be classified as np-hard problems. Finding the optimal solution for multi-variable scheduling problems with polynomial computation times is extremely hard. Scheduling problems of this nature can be solved up to some degree using traditional methodologies. However, intelligent optimization tools, like BBAs, are inspired by the food foraging behavior of honey bees and capable of locating good solutions efficiently. The experiments on some benchmark problems show that BBA outperforms other methods which are used to solve scheduling problems in terms of the speed of optimization and accuracy of the results. This chapter first highlights the use of BBA and its variants for scheduling and provides a classification of scheduling problems with BBA applications. Following this, a step by step example is provided for multi-mode project scheduling problem in order to show how a BBA algorithm can be implemented.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.