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

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.

[1]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

[2]  G. Moslehi,et al.  Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness , 2009 .

[3]  ALOK SINGH,et al.  A Hybrid Permutation-Coded Evolutionary Algorithm for the Early/tardy Scheduling Problem , 2010, Asia Pac. J. Oper. Res..

[4]  Han Hoogeveen,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[5]  Rubén Ruiz,et al.  Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem , 2010 .

[6]  Rainer Leisten,et al.  Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm , 2008 .

[7]  Russell J. Hemley,et al.  A pressing matter , 2006 .

[8]  C. Rajendran.  Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers , 1999 .

[9]  V. Sridharan,et al.  Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review , 2000, Oper. Res..

[10]  Chandrasekharan Rajendran,et al.  Scheduling in flowshops to minimize total tardiness of jobs , 2004 .

[11]  Rubén Ruiz,et al.  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..

[12]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[13]  Yeong-Dae Kim,et al.  Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process , 1996 .

[14]  Kenji Itoh,et al.  A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem , 1995 .

[15]  Chandrasekharan Rajendran,et al.  A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs , 2005, J. Oper. Res. Soc..

[16]  Jorge M. S. Valente.  Beam Search Heuristics for the Single Machine Scheduling Problem with Linear earliness and Quadratic tardiness Costs , 2009, Asia Pac. J. Oper. Res..

[17]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[18]  C. Rajendran,et al.  A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs-a case study , 1997 .

[19]  Chandrasekharan Rajendran,et al.  Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs , 2009, J. Oper. Res. Soc..

[20]  Pankaj Chandra,et al.  Permutation flow shop scheduling with earliness and tardiness penalties , 2004 .