Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem

References

• Abdul-Razaq , TS , Potts , CN and Van Wassenhove , LN . 1990 . A survey of algorithms for the single machine total weighted tardiness scheduling problems . Discr. Appl. Math. , 26 : 235 – 253 .
   Web of Science ®Google Scholar
• Alidaee , B and Ramakrishnan , KR . 1996 . A computational experiment of COVERT-AU class of rules for single machine tardiness scheduling problem . Comput. Ind. Engng , 30 : 201 – 209 .
   Web of Science ®Google Scholar
• Babu , P , Peridy , L and Pinson , E . 2004 . A branch and bound algorithm to minimize total weighted tardiness on a single processor . Ann. Oper. Res. , 129 : 33 – 46 .
   Web of Science ®Google Scholar
• Baker , KR and Schrage , LE . 1978 . Finding an optimal permutation by dynamic programming: an extension to precedence-related tasks . Oper. Res. , 26 : 111 – 120 .
   Web of Science ®Google Scholar
• Bean , JC . 1994 . Genetic algorithm and random keys for sequencing and optimization . ORSA J. Comput. , 6 : 154 – 160 .
   Google Scholar
• Congram , RK , Potts , CN and Van de Velde , SL . 2002 . An iterated dynasearch algorithm for the single machine total weighted tardiness scheduling problem . INFORMS J. Comput. , 14 : 52 – 67 .
   Web of Science ®Google Scholar
• Crauwels , HA , Potts , CN and Van Wassenhove , LN . 1998 . Local search heuristics for the single machine total weighted tardiness scheduling problem . INFORMS J. Comput. , 10 : 341 – 350 .
   Google Scholar
• den Besten , ML , Stützle , T and Dorigo , M . 2000 . “ Ant colony optimization for the total weighted tardiness problem ” . In Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature (PPSN-VI) 611 – 620 . LNCS 1917
   Google Scholar
• den Besten , ML , Stützle , T and Dorigo , M . 2001 . “ Design of iterated local search algorithm: an example application to the single machine total weighted tardiness problem ” . In Applications of Evolutionary Computing Edited by: Boer , EJW , Cagnoni , S , Gottlieb , J , Hart , E , Lanzi , PL , Raidl , GR , Smith , RE and Tijink , H . 441 – 451 . LNCS 2037
   Google Scholar
• Eberhart , RC and Kennedy , J . 1995 . “ A new optimizer using particle swarm theory ” . In Proceedings of the Sixth International Symposium on Micro Machine and Human Science 39 – 43 .
   Google Scholar
• Emmons , H . 1969 . One-machine sequencing to minimize certain functions of job tardiness . Oper. Res. , 17 : 701 – 715 .
   Web of Science ®Google Scholar
• Grosso , A , Della Groce , F and Tadei , R . 2004 . An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem . Oper. Res. Lett. , 32 : 68 – 72 .
   Web of Science ®Google Scholar
• Held , M and Karp , RM . 1962 . A dynamic programming approach to sequencing problems . J. Soc. Ind. Appl. Math. , 10 : 196 – 210 .
   Google Scholar
• Kennedy , J , Eberhart , RC and Shi , Y . 2001 . Swarm Intelligence , San Mateo, CA : Morgan Kaufmann .
   Google Scholar
• Lampinen , J . 2001 . “ A bibliography of differential evolution algorithms ” . In Technical Report , Laboratory of Information Processing, Department of Information Technology, Lappeenranta University of Technology .
   Google Scholar
• Lawler , EL . 1964 . On scheduling problems with deferral costs . Mgmt Sci. , 11 : 280 – 288 .
   Web of Science ®Google Scholar
• Lenstra , JK , Rinnooy Kan , AHG and Brucker , P . 1977 . Complexity of machine scheduling problems . Ann. Discr. Math. , 1 : 343 – 362 .
   Google Scholar
• Maheswaran , R and Ponnambalam , SG . 2003 . An investigation on single machine total weighted tardiness scheduling problems . Int. J. Adv. Mnfg Technol. , 22 : 243 – 248 .
   Web of Science ®Google Scholar
• Maheswaran , R and Ponnambalam , SG . 2005 . An intensive search evolutionary algorithm for single-machine total-weighted-tardiness scheduling problems . Int. J. Adv. Mnfg Technol. , 26 : 1150 – 1156 .
   Web of Science ®Google Scholar
• Matsuo , H , Suh , CJ and Sullivan , RS . 1989 . A controlled search simulated annealing method for the single machine weighted tardiness problem . Ann. Oper. Res. , 21 : 85 – 108 .
   Google Scholar
• McNaughton , R . 1959 . Scheduling with deadlines and loss functions . Mgmt Sci. , 6 : 1 – 12 .
   Web of Science ®Google Scholar
• Merkle , D and Middendorf , M . 2003 . An ant algorithm with global pheromone evaluation for scheduling a single machine . Appl. Intell. , 18 : 105 – 111 .
   Web of Science ®Google Scholar
• Mladenovic , N and Hansen , P . 1997 . Variable neighborhood search . Comput. Oper. Res. , 24 : 1097 – 1100 .
   Web of Science ®Google Scholar
• Onwubolu , GC and Babu , BV . 2004 . New Optimization Techniques in Engineering , New York : Springer .
   Google Scholar
• Potts , CN and Van Wassenhove , LN . 1985 . A branch and bound algorithm for the total weighted tardiness problem . Oper. Res. , 33 : 363 – 377 .
   Web of Science ®Google Scholar
• Potts , CN and Van Wassenhove , LN . 1991 . Single machine tardiness sequencing heuristics . IIE Trans. , 23 : 346 – 354 .
   Web of Science ®Google Scholar
• Rinnooy Kan , AHG , Lageweg , BJ and Lenstra , JK . 1975 . Minimizing total costs in one-machine scheduling . Oper. Res. , 23 : 908 – 927 .
   Web of Science ®Google Scholar
• Schrage , LE and Baker , KR . 1978 . Dynamic programming solution of sequencing problems with precedence constraints . Oper. Res. , 26 : 444 – 449 .
   Web of Science ®Google Scholar
• Shwimer , J . 1972 . On the N-job, one-machine, permutation-independent scheduling problem with tardiness penalties: a branch-bound solution . Mgmt Sci. , 18 : B301 – B313 .
   Web of Science ®Google Scholar
• Storn , R and Price , K . 1995 . “ Differential evolution a simple and efficient adaptive scheme for global optimization over continuous spaces ” . In Technical Report TR-95-012 , ICSI .
   Google Scholar
• Storn , R and Price , K . 1997 . Differential evolution—A simple and efficient heuristic for global optimization over continuous space . J. Global Optim. , 11 : 341 – 359 .
   Web of Science ®Google Scholar
• Tasgetiren , MF , Sevkli , M , Liang , Y-C and Gencyilmaz , G . 2004a . “ Particle swarm optimization algorithm for single machine total weighted tardiness problem ” . In Proceedings of the Congress on Evolutionary Computation (CEC2004) 1412 – 1419 .
   Google Scholar
• Tasgetiren , MF , Sevkli , M , Liang , Y-C and Gencyilmaz , G . 2004b . “ Particle swarm optimization algorithm for permutation flowshop sequencing problem ” . In Proceedings of the 4th International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS2004) , 382 – 390 . LNCS 3172 .
   Google Scholar