SCHEDULING GROUPS OF JOBS IN A PERMUTATION FLOWSHOP TO MINIMIZE TOTAL EARLINESS AND TARDINESS

摘要

This paper presents several procedures for scheduling groups of jobs in a permutation flow shop when the objective is to minimize total earliness and tardiness. These procedures are tested on several problem sets with varying conditions. The results show that a genetic algorithm that includes a neighborhood defined by the sequence of batches of jobs belonging to the same setup family is generally the most effective.