A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times

In this paper, a discrete differential evolution algorithm with the reference local search is presented to solve the single machine total weighted tardiness problem with sequence dependent setup times. In addition, To facilitate the greedy job insertion into a partial solution, newly designed speed-up methods are presented for the insertion move as a further and novel contribution to the single machine tardiness related scheduling with sequence dependent setup times literature. To evaluate its performance, the discrete differential evolution algorithm is tested on a set of benchmark instances from the literature. Through the analyses of experimental results, highly effective performance of the discrete differential evolution algorithm is shown against the best known solutions from the literature, especially, against the very recent newly designed particle swarm optimization algorithm and ant colony algorithm of Anghinolfi & Paolucci [European Journal of Operational Research 2007; don: 10.1016/j.ejor.2007.10.044, Available Online] and Anghinolfi & Paolucci [to appear in the International Journal of Operations Research 2007], respectively. Ultimately, 46 out of 120 aggregated best known solutions so far in the literature are further improved.

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

[2]  Michael Pinedo,et al.  A heuristic to minimize the total weighted tardiness with sequence-dependent setups , 1997 .

[3]  Stephen F. Smith,et al.  Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics , 2005, J. Heuristics.

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

[5]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[6]  Massimo Paolucci,et al.  A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times , 2009, Eur. J. Oper. Res..

[7]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

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

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

[10]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[11]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[12]  Chris N. Potts,et al.  Dynamic programming and decomposition approaches for the single machine total tardiness problem , 1987 .

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

[14]  Mehmet Fatih Tasgetiren,et al.  A Discrete Differential Evolution Algorithm for the Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[15]  Massimo Paolucci,et al.  A New Ant Colony Optimization Approach for the Single Machine Total Weighted Tardiness Scheduling Problem , 2008 .

[16]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[17]  J. E Holsenback,et al.  An improved heuristic for the single-machine, weighted-tardiness problem , 1999 .

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

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

[20]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[21]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[22]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[23]  Vinicius Amaral Armentano,et al.  A genetic algorithm for scheduling on a single machine with set-up times and due dates , 2000 .

[24]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

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

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

[27]  Mehmet Fatih Tasgetiren,et al.  A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[28]  Tapan Sen,et al.  Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey , 2003 .

[29]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[30]  Jorge M. S. Valente,et al.  Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups , 2008, Comput. Oper. Res..

[31]  Shih-Wei Lin,et al.  Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics , 2007 .

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

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

[34]  下平 丕作士,et al.  The Genetic and Evolutionary Computation Conference , 2002 .

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

[36]  Vincent A. Cicirello,et al.  Non-wrapping order crossover: an order preserving crossover operator that respects absolute position , 2006, GECCO.

[37]  R. Storn,et al.  Differential evolution a simple and efficient adaptive scheme for global optimization over continu , 1997 .

[38]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.

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