A novel artificial immune system for solving multiobjective scheduling problems subject to special process constraint

Computers and Industrial Engineering

Volumn 58, Issue 4, 2010, Pages 602-609

  Gao, Jiaquan ^a  

^a ZHEJIANG UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Artificial immune system; Evolutionary algorithm; Multiobjective scheduling; Parallel machines

Indexed keywords

ARTIFICIAL IMMUNE SYSTEM; COMPLETION TIME; DIVERSITY TECHNIQUES; EARLINESS/TARDINESS PENALTIES; IMMUNE GENETIC ALGORITHMS; LOCAL SEARCH ALGORITHM; MAKESPAN; MULTI-OBJECTIVE SCHEDULING; MULTI-OBJECTIVE SCHEDULING PROBLEMS; PARALLEL MACHINE; SEARCH SPACES; SIMULATION RESULT; SOLUTION SPACE; SPECIAL PROCESS CONSTRAINT;

EVOLUTIONARY ALGORITHMS; IMMUNOLOGY; LEARNING ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; VECTOR SPACES;

SCHEDULING ALGORITHMS;

EID: 77950593822     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2009.12.009     Document Type: Article

References (28)

1. Bank J., and Werner F. Heuristics algorithms for unrelated parallel machine scheduling with a common due date, release dates and linear earliness tardiness penalties. Mathematical and Computer Modeling 33 4-5 (2001) 363-383
2. Chen C.L., and Chen C.L. A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines. Computers & Operations Research 36 11 (2009) 3073-3081
3. Chen C.L., and Chen C.L. Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines. Computers & Industrial Engineering 56 4 (2009) 1393-1401
4. Chen J.F. Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups. International Journal of Advanced Manufacturing Technology 29 5-6 (2006) 557-563
5. Darmoul S., Pierreval H., and Gabouj S.H. Scheduling using artificial immune system metaphors: A review. Proceedings of IEEE conference on service systems and service management (2006), IEEE Press, Troyes, France 1150-1155
6. de Castro L.N., and Timmis J. Artificial immune system: A new computational intelligence approach (2002), Springer, New York
7. Dessouky M.M. Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness. Computers & Industrial Engineering 34 4 (1998) 793-806
8. Gao J.Q. A parallel hybrid genetic algorithm for solving a kind of non-identical parallel machine scheduling problems. Proceedings of the eighth conference on highperformance computing in Asia-Pacific Region (2005), IEEE Computer Society, Beijing 469-472
9. Gao J.Q., He G.X., and Wang Y.S. Multi-objective scheduling problems subjected to special process constraint. In: Wang J. (Ed). 2008 IEEE Congress on Evolutionary Computation (2008), IEEE Press, Hongkong 105-110
10. Gao J.Q., He G.X., and Wang Y.S. A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint. International Journal of Advanced Manufacturing Technology 43 1-2 (2009) 151-160
11. Garey M.R., and Johnson D.S. Computers and intractability: A guide to the theory of NP completeness (1979), Freeman, San Francisco
12. Ghedjati F. Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence. Computers & Industrial Engineering 37 1-2 (1999) 39-42
13. Ghirardi M., and Potts C.N. Makespan minimization for unrelated parallel machines: A recovering beam search approach. European Journal of Operational Research 165 2 (2005) 457-467
14. Guo Y.S., Lim A., Rodrigues B., et al. Minimizing the makespan for unrelated parallel machines. International Journal on Artificial Intelligence Tools 16 (2007) 399-415
15. Hoogeveen H. Multicriteria scheduling. European Journal of Operational Research 167 (2005) 592-623
16. Hart E., and Timmis J. Application areas of AIS: The past, the present and the future. Applied Soft Computing 8 1 (2008) 191-201
17. Helal M., Rabadi G., and Al-Salem A. A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times. International Journal of Operations Research 3 (2006) 182-192
18. Ishibuchi H., and Murata T. A multiobjective genetic local search algorithm and its application to flowshop scheduling. IEEE Transaction on System, Man and Cybernetics 28 3 (1998) 392-403
19. Kim D.W., Na D.G., Jang W., and Chen F.F. Simulated annealing and genetic algorithm for unrelated parallel machine scheduling considering set-up times. International Journal of Computer Applications in Technology 26 1-2 (2006) 28-36
20. Logendran R., McDonell B., and Smucker B. Scheduling unrelated parallel machines with sequence-dependent setups. Computers & Operations Research 34 11 (2007) 3420-3438
21. Shim S.O. Generating subproblems in branch and bound algorithms for parallel machines scheduling problem. Computers & Industrial Engineering 57 3 (2009) 1150-1153
22. Silva C., and Magalhaes J.A. Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry. Computers & Industrial Engineering 50 1-2 (2006) 76-89
23. Suresh V., and Chaudhuri D. Bicriteria scheduling problem for unrelated parallel machines. Computers & Industrial Engineering 30 1 (1996) 77-82
24. Tavakkoli-Moghaddam R., Taheri F., Bazzazi M., Izadi M., and Sassani F. Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Computers & Operations Research 36 12 (2009) 3224-3230
25. T'kindt V., and Billaut J.-C. Multicriteria scheduling: Theory, models and algorithms (2006), Springer, Berlin
26. Wang L., and Li D.W. Genetic algorithm for parallel machine scheduling with due windows. Chinese Journal of System Engineering 17 1 (2002) 45-49
27. Yang T. An evolutionary simulation-optimization approach in solving parallel-machine scheduling problems - A case study. Computers & Industrial Engineering 56 3 (2009) 1126-1136
28. Yaurima V., Burtseva L., and Tchernykh A. Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Computers & Operations Research 56 4 (2009) 1452-1463