Job shop scheduling based on earliness and tardiness penalties with due dates and deadlines: an enhanced genetic algorithm

This paper studies a job shop scheduling problem with due dates and deadlines in the presence of tardiness and earliness penalties. Due dates are desired completion dates of jobs given by the customer, while deadlines are determined by the manufacturer based on customer due dates. Due dates can be violated at the cost of tardiness, whereas deadlines must be met and cannot be violated. The aforementioned scheduling problem, which is NP-hard, can be formulated with the objective function of minimizing the sum of weighted earliness and weighted tardiness of jobs subject to due dates and deadlines. In order to solve this problem, an enhanced genetic algorithm (EGA) is introduced in this paper. EGA utilizes an operation-based scheme to represent schedules as chromosomes. After the initial population of chromosomes is randomly generated, each chromosome is processed through a three-stage decoder, which first reduces tardiness based on due dates, second ensures deadlines are not violated, and finally reduces earliness based on due dates. After the population size is reached, EGA continues with selection, crossover, and mutation. The proposed algorithm is tested on 180 job shop scheduling problems of varying sizes and its performance is discussed.

[1]  Jorge M. S. Valente,et al.  A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties , 2009, Comput. Oper. Res..

[2]  Liu Min,et al.  Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems , 2006 .

[3]  Kuo-Ching Ying,et al.  Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm , 2008, Comput. Ind. Eng..

[4]  Chandrasekharan Rajendran,et al.  Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs , 2005, Comput. Ind. Eng..

[5]  Ertan Güner,et al.  Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs , 2010, J. Intell. Manuf..

[6]  Charles R. Standridge,et al.  Modeling and Analysis of Manufacturing Systems , 1993 .

[7]  HANS KELLERER,et al.  Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack , 2010, Int. J. Found. Comput. Sci..

[8]  Philippe Baptiste,et al.  Lagrangian bounds for just-in-time job-shop scheduling , 2008, Comput. Oper. Res..

[9]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[10]  Rong-Hwa Huang,et al.  Ant colony system for job shop scheduling with time windows , 2008 .

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

[12]  Ghaith Rabadi,et al.  A multiagents approach for the Job Shop Scheduling problem with earliness and tardiness , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[13]  Laurent Perron,et al.  Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs , 2003, CP.

[14]  S. Mason,et al.  A moving block heuristic to minimise earliness and tardiness costs on parallel machines , 2009 .

[15]  Egon Balas,et al.  Job Shop Scheduling With Deadlines , 1998, J. Comb. Optim..

[16]  Frank Werner,et al.  Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey , 2004, Math. Comput. Model..

[17]  Mehmet O. Atan,et al.  Single CNC machine scheduling with controllable processing times and multiple due dates , 2008 .

[18]  Christos D. Tarantilis,et al.  Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling , 2008 .

[19]  Kerem Bülbül,et al.  Preemption in single machine earliness/tardiness scheduling , 2007 .

[20]  Safia Kedad-Sidhoum,et al.  Fast neighborhood search for the single machine earliness-tardiness scheduling problem , 2008, Comput. Oper. Res..

[21]  A. M. A. Hariri,et al.  Single machine scheduling with deadlines to minimize the weighted number of tardy jobs , 1994 .

[22]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[23]  Jorge M. S. Valente,et al.  Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties , 2009 .

[24]  Peigen Li,et al.  A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem , 2005, EvoCOP.

[25]  Reinaldo J. Moraga,et al.  A Meta-RaPS for the early/tardy single machine scheduling problem , 2009 .

[26]  Dvir Shabtay,et al.  Due date assignments and scheduling a single machine with a general earliness/tardiness cost function , 2008, Comput. Oper. Res..

[27]  M. Zandieh,et al.  Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times , 2010 .

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

[29]  André Gustavo dos Santos,et al.  A Combination of Evolutionary Algorithm, Mathematical Programming, and a New Local Search Procedure for the Just-In-Time Job-Shop Scheduling Problem , 2010, LION.

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

[31]  Marcone J. F. Souza,et al.  An adaptive genetic algorithm to solve the Single Machine Scheduling Problem with Earliness and Tardiness Penalties , 2010, IEEE Congress on Evolutionary Computation.

[32]  Mohamed A.A. Mansour,et al.  A hybrid genetic algorithm for solving the joint batching and scheduling of a batch processor with earliness and tardiness penalties , 2010 .

[33]  Vincent T'Kindt,et al.  Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances , 2010, J. Sched..

[34]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[35]  J. Christopher Beck,et al.  A Hybrid Approach to Scheduling with Earliness and Tardiness Costs , 2003, Ann. Oper. Res..

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

[37]  L. Darrell Whitley,et al.  Algorithm Performance and Problem Structure for Flow-shop Scheduling , 1999, AAAI/IAAI.

[38]  Safia Kedad-Sidhoum,et al.  Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates , 2008, Eur. J. Oper. Res..

[39]  Pascal Van Hentenryck,et al.  Just-In-Time Scheduling with Constraint Programming , 2009, ICAPS.