A hybrid discrete differential evolution algorithm to minimise total tardiness on identical parallel machines

References

• Alidaee , B. and Rosa , D. 1997 . Scheduling parallel machines to minimize total weighted and unweighted tardiness . Computers and Operations Research , 24 : 775 – 788 .
   Web of Science ®Google Scholar
• Armentano , V.A. and Yamashita , D.S. 2000 . Tabu search for scheduling on identical parallel machines to minimize mean tardiness . Journal of Intelligent Manufacturing , 11 : 453 – 460 .
   Web of Science ®Google Scholar
• Azizoglu , M. and Kirca , O. 1998 . Tardiness minimization on parallel machines . International Journal of Production Economics , 55 : 163 – 168 .
   Web of Science ®Google Scholar
• Baker , K.R. and Bertrand , J.W.M. 1982 . A dynamic priority rule for scheduling against due-dates . Journal of Operations Management , 3 : 37 – 42 .
   Google Scholar
• Barnes , J.W. and Brennan , J.J. 1977 . An improved algorithm for scheduling jobs on identical machines . AIIE Transactions , 9 : 25 – 31 .
   Google Scholar
• Biskup , D. , Herrmann , J. and Gupta , J.N.D. 2008 . Scheduling identical parallel machines to minimize total tardiness . International Journal of Production Economics , 115 : 134 – 142 .
   Web of Science ®Google Scholar
• Chaudhry , I.A. and Drake , P.R. 2009 . Minimizing total tardiness in parallel-machine scheduling with release dates . International Journal of Advanced Manufacturing Technology , 42 : 581 – 594 .
   Web of Science ®Google Scholar
• Dogramaci , A. and Surkis , J. 1979 . Evaluation of a heuristic for scheduling independent jobs on parallel identical processors . Management Science , 25 : 1208 – 1216 .
   Web of Science ®Google Scholar
• Du , J. and Leung , J.Y.T. 1990 . Minimizing total tardiness on one machine is NP-hard . Mathematics of Operations Research , 15 : 483 – 495 .
   Web of Science ®Google Scholar
• Elmaghraby , S.E. and Park , S.H. 1974 . Scheduling jobs on a number of identical machines . AIIE Transactions , 6 : 1 – 13 .
   Google Scholar
• Fisher , M.L. 1976 . A dual algorithm for the one-machine scheduling problem . Mathematical Programming , 11 : 229 – 251 .
   Web of Science ®Google Scholar
• Goldberg , D. and Lingle , R.J. Alleles, loci, and the travelling salesman problem . Proceedings of first international conference on genetic algorithms and their applications . July 24–26 . Edited by: J.J. , Grefenstette . pp. 154 – 159 . Hilladale, NJ : Lawrence Erlbaum Associates .
   Google Scholar
• Graham , R.L. 1979 . Optimization and approximation in deterministic sequencing and scheduling: a survey . Annals of Discrete Mathematics , 5 : 287 – 326 .
   Google Scholar
• Ho , J.C. and Chang , Y.L. 1991 . Heuristics for minimizing mean tardiness for m parallel machines . Naval Research Logistics , 38 : 367 – 381 .
   Web of Science ®Google Scholar
• Jayaprakash , G. , Sivakumar , K. and Thilak , M. 2012 . FEA compliant parametric tolerance allocation of mechanical assembly using neural network and differential evolution algorithm . International Journal of Computer Integrated Manufacturing , 25 : 636 – 654 .
   Web of Science ®Google Scholar
• Kim , J. 2012 . Optimum subdivision of curved hull plates for efficient ship manufacture using minimum strain energy . International Journal of Computer Integrated Manufacturing , 25 : 608 – 624 .
   Web of Science ®Google Scholar
• Koulamas , C. 1994 . The total tardiness problem: review and extensions . Operations Research , 42 : 1025 – 1041 .
   Web of Science ®Google Scholar
• Koulamas , C. 1997 . Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem . Naval Research Logistics , 44 : 109 – 125 .
   Web of Science ®Google Scholar
• Koulamas , C. 2010 . The single-machine total tardiness scheduling problem: review and extensions . European Journal of Operational Research , 202 : 1 – 7 .
   Web of Science ®Google Scholar
• Kovalyov , M. and Werner , F. 2002 . Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness . Journal of Heuristics , 8 : 415 – 428 .
   Web of Science ®Google Scholar
• Nessah , R. , Yalaoui , F. and Chu , C. 2008 . A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates . Computers and Operations Research , 35 : 1176 – 1190 .
   Web of Science ®Google Scholar
• Niu , Q. , Zhou , T. and Wang , L. 2010 . A hybrid particle swarm optimization for parallel machine total tardiness scheduling . International Journal of Advanced Manufacturing Technology , 49 : 723 – 739 .
   Web of Science ®Google Scholar
• Onwubolu , G.C. and Davendra , D. 2006 . Scheduling flow shops using differential evolution algorithm . European Journal of Operational Research , 171 : 674 – 692 .
   Web of Science ®Google Scholar
• Pan , Q.K. , Tasgetiren , M.F. and Liang , Y.C. 2008 . A discrete differential evolution algorithm for the permutation flowshop scheduling problem . Computers and Industrial Engineering , 55 : 795 – 816 .
   Web of Science ®Google Scholar
• Panwalkar , S.S. , Smith , M.L. and Koulamas , C. 1993 . A heuristic for the single machine tardiness problem . European Journal of Operational Research , 70 : 304 – 310 .
   Web of Science ®Google Scholar
• Qian , B. 2009 . A DE-based approach to no-wait flow-shop scheduling . Computers and Industrial Engineering , 57 : 787 – 805 .
   Web of Science ®Google Scholar
• Root , J.G. 1965 . Scheduling with deadlines and loss functions on k parallel machines . Management Science , 11 : 460 – 475 .
   Web of Science ®Google Scholar
• Ruiz , R. and Stutzle , T. 2007 . A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem . European Journal of Operational Research , 177 : 2033 – 2049 .
   Web of Science ®Google Scholar
• Shim , S.O. and Kim , Y.D. 2007 . Scheduling on parallel identical machines to minimize total tardiness . European Journal of Operational Research , 177 : 135 – 146 .
   Web of Science ®Google Scholar
• Storn , R. and Price , K. 1997 . Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces . Journal of Global Optimization , 11 : 341 – 359 .
   Web of Science ®Google Scholar
• Su , G.J. and Wang , X.H. 2011 . Weighted nested partitions based on differential evolution (WNPDE) algorithm-based scheduling of parallel batching processing machines (BPM) with incompatible families and dynamic lot arrival . International Journal of Computer Integrated Manufacturing , 24 : 552 – 560 .
   Web of Science ®Google Scholar
• Tanaka , S. and Araki , M. 2008 . A branch-and-bound algorithm with lagrangian relaxation to minimize total tardiness on identical parallel machines . International Journal of Production Economics , 113 : 446 – 458 .
   Web of Science ®Google Scholar
• Tasgetiren , M.F. A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flowtime criterion . Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling . April 1–5 2007 . pp. 251 – 258 . IEEE Press .
   Google Scholar
• Wilkerson , L.J. and Irwin , J.D. 1971 . An improved algorithm for scheduling independent tasks . AIIE Transactions , 3 : 239 – 245 .
   Google Scholar
• Yalaoui , F. and Chu , C. 2002 . Parallel machine scheduling to minimize total tardiness . International Journal of Production Economics , 76 : 265 – 279 .
   Web of Science ®Google Scholar