A GRASP based on DE to solve single machine scheduling problem with SDST

When handling combinatorial optimization problems, we try to get the optimal arrangement of discrete entities so that the requirements and the constraints are satisfied. These problems become more and more important in various industrial and academic fields. So, over the past years, several techniques have been proposed to solve them. In this paper, we are interested in the single machine scheduling problem with Sequence-Dependent Setup Times, which can be solved through different approaches. We present a hybrid algorithm which combines Greedy Randomized Adaptive Search Procedure and Differential Evolution for tackling this problem. Our algorithm is tested on benchmark instances from the literature. The computational experiments prove the efficiency of this algorithm.

[1]  Chengbin Chu,et al.  A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness , 2007, Eur. J. Oper. Res..

[2]  J. R. Brown,et al.  A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem , 1995 .

[3]  Ching-Jong Liao,et al.  An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups , 2007, Comput. Oper. Res..

[4]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[5]  Celso C. Ribeiro,et al.  GRASP and VNS for Max-Cut , 2002 .

[6]  Jonathan F. Bard,et al.  A GRASPTM for a difficult single machine scheduling problem, , 1991, Comput. Oper. Res..

[7]  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..

[8]  Shih-Wei Lin,et al.  Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic , 2009, Expert Syst. Appl..

[9]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[10]  Feng Chu,et al.  A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness , 2006, Appl. Math. Comput..

[11]  C. J. Liao,et al.  Sequencing heuristics for dependent setups in a continuous process industry , 1996 .

[12]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[13]  Michel Gendreau,et al.  A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times , 1996 .

[14]  W. J. Selen,et al.  Operational production planning in a chemical manufacturing environment , 1990 .

[15]  Marc Gravel,et al.  Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems , 2005, J. Oper. Res. Soc..

[16]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[17]  Paul A. Rubin,et al.  Scheduling in a sequence dependent setup environment with genetic search , 1995, Comput. Oper. Res..

[18]  Gilles Savard,et al.  The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times , 2006, Discret. Optim..

[19]  Jeffrey S. Smith,et al.  Algorithms for single machine total tardiness scheduling with sequence dependent setups , 2006, Eur. J. Oper. Res..

[20]  Pablo Moscato,et al.  A memetic algorithm for the total tardiness single machine scheduling problem , 2001, Eur. J. Oper. Res..

[21]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[22]  Marc Gravel,et al.  Scheduling jobs in an Alcan aluminium foundry using a genetic algorithm , 2000 .

[23]  Thomas A. Feo,et al.  A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties , 1996, Comput. Oper. Res..

[24]  C. Klein,et al.  Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness , 1999 .

[25]  Keah Choon Tan,et al.  Minimizing Tardiness on a Single Processor with Sequence Dependent Setup Times: A Simulated Annealing Approach , 1997 .

[26]  Marc Gravel,et al.  Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times , 2002, J. Oper. Res. Soc..

[27]  Paul A. Rubin,et al.  A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times , 2000 .

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

[29]  W. J. Chen,et al.  Scheduling under machine breakdown in a continuous process industry , 2004, Comput. Oper. Res..

[30]  B. M. Khumawala,et al.  A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times , 1995 .