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

Optimization of welding job-shop scheduling problem under variable workstation constraint: an industrial application with Arena simulation based genetic algorithm

“…They optimized maximum makespan, maximum machine load and total machine load. Karaoglan et al [23] used artificial bee colony (ABC) algorithm to optimize the welding shop scheduling problem (WSSP) to minimize the makespan. They used deterministic processing times.…”

“…They modeled the problem as mixed integer programming model (MIPM) and then solve the model by NSGA with a restarted strategy. However WSSP for JSSP (which is the subject of the current study) is studied by Karaoglan et al [23] and a novel problem is established with variable workstation constraint. They solved the problem using ABC algorithm coded by Matlab.…”

“…Using probabilistic processing times and Arena simulation provide to consider the dynamic job-shop conditions and get more applicable solutions. The contributions of this study to the literature are: (i) using variable workstation constraint, (ii) solving welding shop scheduling problem (WSSP) -which is studied by Rao et al [27] and Karaoglan et al [23]-under the stochastic processing times. They used mixed-integer programming model (MIPM).…”

“…Inverse JSSP Total weighted makespan Zhang et al [21] PSO, ANN JSSP Makespan Zhu et al [22] Improved WOA, quantum computing JSSP Makespan, maximum machine load, total machine load Karaoglan et al [23] ABC WSSP with deterministic times Makespan Shi et al [24] Fuzzy and immune GA MO-FJSSP Makespan, energy consumption, consumer dissatisfaction Gu et al [25] GA-GWO Low-carbon JSSP Sum of energy consumption cost, completion time cost Vital-Soto [26] BFO FJSSP with sequencing flexibility Weighted lateness Rao et al [27] NSGA BWSSP with deterministic times Total tardiness, total penalty…”