Artificial Bee Colony Algorithm for Labor Intensive Project Type Job Shop Scheduling Problem: A Case Study
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.
KeywordsScheduling Artificial bee colony algorithm Labor-intensive project type production
- Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization (Technical Report-TR06).Google Scholar