Memes co‐evolution strategies for fast convergence in solving single machine scheduling problems

References

• Abdul‐Razaq , TS , Potts , CN and Van Wassenhove , LN . 1990 . A survey of algorithms for the single machine total weighted tardiness scheduling problem . Discrete Applied Mathematics , 26 ( 2–3 ) : 235 – 253 .
   Web of Science ®Google Scholar
• Bauer , A . 1999 . An ant colony optimization approach for the single machine total tardiness problem . In Proceedings of the 1999 Congress on Evolutionary Computation CEC99 . 1999 , Piscataway , NJ. 2, 1445–1450
   Google Scholar
• Besten , MD , Stützle , T and Dorigo , M . 2000 . “ Ant colony optimization for the total weighted tardiness problem ” . In Parallel problem solving from nature‐PPSN VI, of Lecture Notes in Computer Science , Edited by: Schoenauer , M . 611 – 620 . New York : Springer Verlag, 1917 .
   Google Scholar
• Besten , MD , Stutzle , T and Dorigo , M . 2001 . “ Design of iterated local search algorithms ‐ an example application to the single machine total weighted tardiness problem ” . In Applications of evolutionary computing , Edited by: Boers , EJW . 441 – 451 . New York : Springer, 2037/2001 .
   Google Scholar
• Chiang , TC and Fu , LC . 2008 . A rule‐centric memetic algorithm to minimize the number of tardy jobs in the job shop . International Journal of Production Research , 46 ( 24 ) : 6913 – 6931 .
   Web of Science ®Google Scholar
• Congram , RK , Potts , CN and van de Velde , SL . 2002 . An iterated dynasearch algorithm for the single‐machine total weighted tardiness problem . INFORMS Journal on Computing , 14 ( 1 ) : 52 – 67 .
   Web of Science ®Google Scholar
• Crauwels , HAJ , Potts , CN and Wassenhove , LNV . 1998 . Local search heuristics for the single machine total weighted tardiness scheduling problem . INFORMS Journal on Computing , 10 ( 3 ) : 341 – 350 .
   Google Scholar
• Dorigo , M and Di Caro , G . 1999 . The Ant Colony Optimization meta‐heuristic. New ideas in optimization , 11 – 32 . New York : McGraw‐Hill .
   Google Scholar
• Dorigo , M , Di Caro , G and Gambardella , LM . 1999 . Ant algorithms for discrete optimization . Artificial Life , 5 ( 2 ) : 137 – 172 .
   PubMed Web of Science ®Google Scholar
• Du , J and Leung , JYT . 1990 . Minimizing total tardiness on one machine is NP‐hard . Mathematics of Operations Research , 15 ( 3 ) : 483 – 495 .
   Web of Science ®Google Scholar
• Ferland , JA . 2001 . Scheduling using tabu search methods with intensification and diversification . Computers and Operations Research , 28 ( 11 ) : 1075 – 1092 .
   Web of Science ®Google Scholar
• Gen , M and Cheng , R . 1996 . Genetic algorithms and engineering design , New York : Wiley .
   Google Scholar
• Graham , RL . 1979 . Optimization and approximation in deterministic sequencing and scheduling: a survey . Annals of Discrete Mathematics , 5 ( 2 ) : 287 – 326 .
   Google Scholar
• Hariri , AMA and Potts , CN . 1983 . An algorithm for single machine sequencing with release times to minimize total weighted completion time . Discrete Applied Mathematics , 5 ( 1 ) : 99 – 109 .
   Web of Science ®Google Scholar
• Hertz , A and Widmer , M . 2003 . Guidelines for the use of meta‐heuristics in combinatorial optimization . European Journal of Operational Research , 151 ( 2 ) : 247 – 252 .
   Web of Science ®Google Scholar
• Holland , JH . 1973 . Genetic algorithms and the optimal allocation of trials . SIAM Journal on Computing , 2 ( 2 ) : 88 – 105 .
   Google Scholar
• Holsenback , JE and Russell , RM . 1992 . A heuristic algorithm for sequencing on one machine to minimize total tardiness . The Journal of the Operational Research Society , 43 ( 1 ) : 53 – 62 .
   Web of Science ®Google Scholar
• Kondakci , S , Kirca , O and Azizoglu , M . 1994 . An efficient algorithm for the single machine tardiness problem . International Journal of Production Economics , 36 ( 2 ) : 213 – 219 .
   Web of Science ®Google Scholar
• Laguna , M , Marti , R and Campos , V . 1999 . Intensification and diversification with elite tabu search solutions for the linear ordering problem . Computers and Operations Research , 26 ( 12 ) : 1217 – 1230 .
   Web of Science ®Google Scholar
• Lawler , EL . 1977 . A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness . Annals of Discrete Mathematics , 1 : 331 – 342 .
   Google Scholar
• Lenstra , JK , Rinnooy Kan , AHG and Brucker , P . 1997 . Complexity of machine scheduling problem . Annals of Discrete Mathematics , 1 : 343 – 362 .
   Google Scholar
• Lim , MH . 2009 . Editorial to the first issue . Memetic Computing , 1 ( 1 ) : 1 – 2 .
   Google Scholar
• Maheswaran , R and Ponnambalan , SG . 2003 . An investigation on single machine total weighted tardiness scheduling problems . The International Journal of Advanced Manufacturing Technology , 22 ( 3–4 ) : 243 – 248 .
   Web of Science ®Google Scholar
• Matsuo , H . Suh, C.J. and Sullivan, R.S., 1987. A controlled search simulated annealing method for the single machine weighted tardiness problem. Working paper 87‐12‐2, Department of Management, University of Texas at Austin, TX
   Google Scholar
• McNaughton , R . 1959 . Scheduling with deadlines and loss functions . Management Science , 6 ( 1 ) : 1 – 12 .
   Web of Science ®Google Scholar
• Merkle , D and Middendorf , M . 2000 . “ An Ant algorithm with a new pheromone evaluation rule for total tardiness problems ” . In Real‐world applications of evolutionary computing, of Lecture Notes in Computer Science , Edited by: Cagnoni , S . 287 – 296 . New York : Springer Verlag, 1803 .
   Google Scholar
• Meuth , R . 2009 . A proposition on memes and meta‐memes in computing for higher‐order learning . Memetic Computing , 1 ( 2 ) : 85 – 100 .
   Google Scholar
• Moscato , P . 1989. On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Technical report C3P 826, Caltech Concurrent Computation Program
   Google Scholar
• Nearchou , AC . 2004 . Solving the single machine total weighted tardiness scheduling problem using a hybrid simulated annealing algorithm . In: 2nd IEEE International Conference on Industrial Informatics INDIN’04 . 2004 , Berlin , 513–516.
   Google Scholar
• Panneerselvam , R . 2006 . Simple heuristic to minimize total tardiness in a single machine scheduling problem . International Journal of Advanced Manufacturing Technology , 30 ( 7–8 ) : 722 – 726 .
   Web of Science ®Google Scholar
• Panwalkar , SS , Smith , ML and Koulamas , CP . 1993 . A heuristic for the single machine tardiness problem . European Journal of Operational Research , 70 ( 2 ) : 304 – 310 .
   Web of Science ®Google Scholar
• Potts , CN and Wassenhove , LNV . 1991 . Single machine tardiness sequencing heuristics . IIE Transactions , 23 ( 4 ) : 346 – 354 .
   Web of Science ®Google Scholar
• Schmitt , L . 2004 . “ Classification with scaled genetic algorithms in a coevolutionary setting ” . In Genetic and Evolutionary Computation Conference, of Lecture Notes in Computer Science , Edited by: Poli , R . 138 – 149 . Berlin, Germany : Springer, 3103 .
   Google Scholar
• Sen , T , Sulek , JM and Dileepan , P . 2003 . Static scheduling research to minimize weighted and unweighted tardiness: a state‐of‐the‐art survey . International Journal of Production Economics , 83 ( 1 ) : 1 – 12 .
   Web of Science ®Google Scholar
• Tanaka , S . 2011. wtopt.zip [online]. Available from: http://turbine.kuee.kyoto‐u.ac.jp/ ∼ tanaka/SiPS/SiPS.html [accessed 19 April 2011]
   Google Scholar
• Tanaka , S , Fujikuma , S and Araki , M . 2009 . An exact algorithm for single‐machine scheduling without machine idle time . Journal of Scheduling , 12 ( 6 ) : 575 – 593 .
   Web of Science ®Google Scholar
• Tasgetiren , MF . 2006 . Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem . International Journal of Production Research , 44 ( 22 ) : 4737 – 4754 .
   Web of Science ®Google Scholar
• Tsang , EPK and Li , J . 2002. EDDIE for financial forecasting. In: S.‐H. Chen, ed. Genetic algorithms and programming in computational finance, Kluwer Academic Press, 161–174
   Google Scholar
• Webster , S , Jog , D and Gupta , A . 1998 . A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date . International Journal of Production Research , 36 ( 9 ) : 2543 – 2551 .
   Web of Science ®Google Scholar
• Wiegand , RP . 2003 . An analysis of cooperative coevolutionary algorithms. , Computer Science, Master of Science) : Thesis (Bachelor of Science . University of North Carolina
   Google Scholar