Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems

Journal of Bionic Engineering

Volumn 5, Issue 2, 2008, Pages 111-119

  Yang, Jin hui ^a   Sun, Liang ^a   Lee, Heow Pueh ^b,c   Qian, Yun ^d   Liang, Yan chun ^a  

^a JILIN UNIVERSITY   (China)

^b INSTITUTE OF HIGH PERFORMANCE COMPUTING   (Singapore)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^d BEIHUA UNIVERSITY   (China)

Author keywords

clonal selection algorithm; global search; job shop scheduling problem; local search; simulated annealing

Indexed keywords

ALGORITHMS; ANNEALING; BOOLEAN FUNCTIONS; EVOLUTIONARY ALGORITHMS; LEARNING ALGORITHMS; MECHANISMS; SCHEDULING; SIMULATED ANNEALING;

BENCH-MARK PROBLEMS; CLONAL SELECTION; HYPER MUTATION; JOB SHOP SCHEDULING PROBLEM (JSSP); LOCAL OPTIMUM; LOCAL SEARCH (LS); LOCAL SEARCH (LS) ALGORITHM; MEMETIC ALGORITHM (MA); NUMERICA L RESULTS; RECEPTOR (IR);

SCHEDULING ALGORITHMS;

EID: 45849153497     PISSN: 16726529     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1672-6529(08)60014-1     Document Type: Article

References (21)

1. Heilmann R. A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. European Journal of Operational Research 144 (2003) 348-365
2. Lorigeon T. A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint. Journal of the Operational Research Society 53 (2002) 1239-1246
3. Canbolat Y., and Gundogar E. Fuzzy priority rule for job shop scheduling. Journal of Intelligent Manufacturing 15 (2004) 527-533
4. Huang W., and Yin A. An improved shifting bottleneck procedure for the job shop scheduling problem. Computers & Operations Research 31 (2004) 2093-2110
5. Chen H., and Luh P. An alternative framework to Lagrangian relaxation approach for job shop scheduling. European Journal of Operational Research 149 (2003) 499-512
6. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Science 42 (1996) 797-813
7. Watanabe M., Ida K., and Gen M. A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Computers & Industrial Engineering 48 (2005) 743-752
8. Gonçalves J., de Magalhǎes Mendes J., and Resende M. A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 167 (2005) 77-95
9. Wang T., and Wu K. A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems. International Journal of Systems Science 31 (2000) 537-542
10. Ventresca M., and Ombuki B. Ant colony optimization for job shop scheduling problem. Proceedings of the Eighth IASTED International Conference on Artificial Intelligence and Soft Computing (2004), Anaheim, California 28-34
11. Xia W., Wu Z., Zhang W., and Yang G. Applying particle swarm optimization to job-shop scheduling problem. Chinese Journal of Mechanical Engineering (English Edition) 17 (2004) 437-441
12. Liu B., Wang L., and Jin Y. An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Transactions on Systems, Man and Cybernetics-Part B: Cybernetics 37 (2007) 18-27
13. Coello C., Rivera D., and Cortes N. Use of an artificial immune system for job shop scheduling. Lecture Notes in Computer Science 2787 (2003) 1-10
14. Moscato P. Memetic algorithms: A short introduction. New Ideas in Optimization 14 (1999) 219-234
15. Ong Y., and Keane A. Meta-Lamarckian learning in memetic algorithms. IEEE Transactions on Evolutionary Computation 8 (2004) 99-110
16. Giffler J., and Thompson G. Algorithms for solving production scheduling problems. Operations Research 8 (1960) 487-503
17. Van Laarhoven P., Aarts E., and Lenstra J. Job shop scheduling by simulated annealing. Operations Research 40 (1992) 113-125
18. Hasan M., and Osman I. Local search algorithm for the maximal planar layout problem. International Transactions in Operational Research 2 (1995) 89-106
19. Beasley J. OR-library: Distributing test problems by electronic mail. Journal of the Operations Research Society 41 (1990) 1069-1072
20. Binato S., Hery W., Loewenstern D., and Resende M. A GRASP for Job Shop Scheduling, Essays and Surveys in Metaheuristics (2001), Kluwer Academic Publishers, Boston 59-80
21. Nuijten W., and Aarts E. Computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research 90 (1996) 269-284