A heuristic algorithm for solving flexible job shop scheduling problem

This paper deals with the flexible job shop scheduling problem with the objective of minimizing the makespan. An efficient heuristic based on a constructive procedure is developed to obtain high-quality schedules very quickly. The algorithm is tested on benchmark instances from the literature in order to evaluate its performance. Computational results show that, despite its simplicity, the proposed heuristic can obtain effective solutions in very short and nearly zero time and is comparable with even metaheuristic algorithms and promising for practical problems.