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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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.
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.
Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization (Technical Report-TR06).
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.
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.
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.
Wang, X., & Duan, H. (2014). A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Computers & Industrial Engineering, 73, 96–114.
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.
Yurtkuran, A., & Emel, E. (2016). A discrete artificial bee colony algorithm for single machine scheduling problems. International Journal of Production Research, 54, 6860–6878.
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Karaoglan, A.D., Cetin, E. (2019). Artificial Bee Colony Algorithm for Labor Intensive Project Type Job Shop Scheduling Problem: A Case Study. In: Calisir, F., Cevikcan, E., Camgoz Akdag, H. (eds) Industrial Engineering in the Big Data Era. Lecture Notes in Management and Industrial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-030-03317-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-03317-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03316-3
Online ISBN: 978-3-030-03317-0
eBook Packages: EngineeringEngineering (R0)