Advertisement

Artificial Bee Colony Algorithm for Labor Intensive Project Type Job Shop Scheduling Problem: A Case Study

  • Aslan Deniz KaraoglanEmail author
  • Ezgi Cetin
Conference paper
Part of the Lecture Notes in Management and Industrial Engineering book series (LNMIE)

Abstract

Job shop scheduling for labor-intensive and project type manufacturing is a too hard task because the operation times are not known before production and change according to the orders’ technical specifications. In this paper, a case study is presented for scheduling a labor-intensive and project type workshop. The aim is to minimize the makespan of the orders. For this purpose, the artificial bee colony algorithm (ABC) is used to determine the entry sequence of the waiting orders to the workshop and dispatching to the stations. 18 different orders and 6 welding stations are used for the scheduling in this case. The input data of the algorithm are the technical specifications (such as weight and width of the demanded orders) and processing times of the orders which vary according to the design criteria demanded by the customers. According to the experimental results, it is observed that the ABC algorithm has reduced the makespan.

Keywords

Scheduling Artificial bee colony algorithm Labor-intensive project type production 

References

  1. Asadzadeh, L. (2016). A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Computers & Industrial Engineering, 102, 359–367.CrossRefGoogle Scholar
  2. Bulut, O., & Tasgetiren, M. F. (2014). An artificial bee colony algorithm for the economic lot scheduling problem. International Journal of Production Research, 52, 1150–1170.CrossRefGoogle Scholar
  3. Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization (Technical Report-TR06).Google Scholar
  4. Karaoglan, A. D., & Celik, N. (2016). A new painting process for vessel radiators of transformer: Wet-on-wet (WOW). Journal of Applied Statistics, 43, 370–386.MathSciNetCrossRefGoogle Scholar
  5. Karaoglan, A. D., & Karademir, O. (2016). Flow time and product cost estimation by using an artificial neural network (ANN): A case study for transformer orders. Engineering Economist, 62(3), 272–292.CrossRefGoogle Scholar
  6. Lei, D., & Guo, X. (2013). Scheduling job shop with lot streaming and transportation through a modified artificial bee colony. International Journal of Production Research, 51, 4930–4941.MathSciNetCrossRefGoogle Scholar
  7. Wang, X., & Duan, H. (2014). A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Computers & Industrial Engineering, 73, 96–114.CrossRefGoogle Scholar
  8. Wang, L., Zou, G., Xu, Y., & Liu, M. (2013). A hybrid artificial bee colony algorithm for the fuzzy flexible job-shop scheduling problem. International Journal of Production Research, 51, 3593–3608.CrossRefGoogle Scholar
  9. Yurtkuran, A., & Emel, E. (2016). A discrete artificial bee colony algorithm for single machine scheduling problems. International Journal of Production Research, 54, 6860–6878.CrossRefGoogle Scholar
  10. Zhang, R., Shiji, S., & Cheng, W. (2013). A hybrid artificial bee colony algorithm for the job shop scheduling problem. International Journal of Production Economics, 141, 167–168.CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Industrial Engineering, Engineering FacultyBalikesir UniversityBalikesirTurkey

Personalised recommendations