Combination of Genetic Algorithm and LP-metric to solve single machine bi-criteria scheduling problem

This paper addresses single machine bi-criteria scheduling problem with the aim of minimizing total weighted tardiness and weighted number of tardy jobs. While weighted number of tardy jobs measures the service quality provided to customers, total weighted tardiness quantify the magnitude of lateness of each job. Therefore, considering both objectives, simultaneously, will provide the highest customers satisfaction. Both objectives are known to be NP-hard, thus, Genetic Algorithm is hired to solve the problem. Since LP-metric method is a rigorous multi-objective technique for making a combined dimensionless objective, it is used to navigate the search direction of Genetic algorithm. In this way, we can reach to some of solutions that are compatible to decision maker's opinion while overcoming the issue of problem complexity. Finally for testing the efficiency of the proposed approach, some test problems are solved.

[1]  L. V. Wassenhove,et al.  Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .

[2]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[3]  Xianpeng Wang,et al.  A population-based variable neighborhood search for the single machine total weighted tardiness problem , 2009, Comput. Oper. Res..

[4]  Ram V. Rachamadugu,et al.  Accurate myopic heuristics for tardiness scheduling , 1984 .

[5]  Francis J. Vasko,et al.  A performance comparison of heuristics for the total weighted tardiness problem , 1997 .

[6]  Fuh-Der Chou,et al.  An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem , 2009, Expert Syst. Appl..

[7]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[8]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[9]  Chris N. Potts,et al.  Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..

[10]  Ahmet B. Keha,et al.  Using genetic algorithms for single-machine bicriteria scheduling problems , 2003, Eur. J. Oper. Res..

[11]  Pei-Chann Chang,et al.  Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems , 2007, Expert Syst. Appl..

[12]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[13]  Jinjiang Yuan,et al.  Single machine parallel-batch scheduling with deteriorating jobs , 2009, Theor. Comput. Sci..

[14]  G. Wang,et al.  Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning , 2009 .

[15]  M. B. Aryanezhad,et al.  Designing safe job rotation schedules based upon workers’ skills , 2009 .

[16]  F. Fred Choobineh,et al.  A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times , 2006, Eur. J. Oper. Res..

[17]  Stéphane Dauzère-Pérès,et al.  Genetic algorithms to minimize the weighted number of late jobs on a single machine , 2003, Eur. J. Oper. Res..

[18]  Xiaoming Li,et al.  A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness , 2004, J. Sched..

[19]  Robert L. Bulfin,et al.  Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs , 1983 .

[20]  William G. Ferrell,et al.  MULTIOBJECTIVE SINGLE MACHINE SCHEDULING WITH NONTRADITIONAL REQUIREMENTS , 2007 .

[21]  Benjamin P.-C. Yen,et al.  Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs , 2009, Eur. J. Oper. Res..

[22]  Philippe Baptiste,et al.  A branch and bound to minimize the number of late jobs on a single machine with release time constraints , 2003, Eur. J. Oper. Res..

[23]  Jay B. Ghosh,et al.  Batch scheduling to minimize the weighted number of tardy jobs , 2007, Comput. Ind. Eng..