THE EFFICIENCY OF A NEW GREEDY HEURISTIC FOR SOLVING PERMUTATION FLOWSHOP SCHEDULING PROBLEM

摘要

This paper presents an original greedy constructive algorithm for solving the permutation flowshop scheduling problem with makespan optimization criterion. The algorithm starts with a pair of jobs chosen based on optimization criterion and adds every new job to the schedule by means of a greedy selection procedure. Expansive computational experiments indicate that, concerning the quality of solutions, selective greedy heuristic performs almost as well as NEH algorithm.