A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness

Abstract

This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimising total earliness and tardiness. A genetic algorithm is proposed for the problem. This procedure and five other procedures were tested on problem sets that varied in terms of number of jobs, machines and the tightness and range of due dates. It was found that the genetic algorithm procedure was consistently effective in generating good solutions relative to the other procedures.

Keywords:

• scheduling
• heuristics
• flow shop
• earliness and tardiness