A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration

A study of permutation crossover operators on the traveling salesman problem

I. M. Oliver, David J. Smith, J. R. C. Holland · international conference on Genetic algorithms · 1987 · 893 citations

Architecture, Computer Science, Algorithms +13

Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling

Hisao Ishibuchi, Takafumi Yoshida, Tadahiko Murata · IEEE Transactions on Evolutionary Computation · 2003 · 774 citations

Natural Sciences, Computer Engineering, Computer Science +17

Meta-Lamarckian Learning in Memetic Algorithms

Yew-Soon Ong, Andy J. Keane · IEEE Transactions on Evolutionary Computation · 2004 · 657 citations

Computing, Computer Science, Algorithms +16

A concise survey of scheduling with time-dependent processing times

T.C.E. Cheng, Qingqing Ding, Bertrand M.T. Lin · European Journal of Operational Research · 2003 · 636 citations · Full text

Computing, Computer Engineering, Computer Science +13

Scheduling with time dependent processing times: Review and extensions

Bahram Alidaee, Norman Keith Womer · Journal of the Operational Research Society · 1999 · 468 citations

Computing, Computer Engineering, Computer Science +11