An improved genetic algorithm for job shop scheduling problem

Proceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010

Volumn , Issue , 2010, Pages 113-116

  Ren, Qing Dao Er Ji ^a   Wang, Yuping ^a   Si, Xiaojing ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Crossover oprator; Genetic algorithm; Job shop scheduling problem; Mutation operator

Indexed keywords

BENCH-MARK PROBLEMS; CROSSOVER AND MUTATION; CROSSOVER OPRATOR; IMPROVED GENETIC ALGORITHMS; JOB SHOP PROBLEM; JOB SHOP SCHEDULING PROBLEMS; MUTATION OPERATOR; NP-HARD PROBLEM;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GENETIC ALGORITHMS;

MATHEMATICAL OPERATORS;

EID: 79951649396     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIS.2010.32     Document Type: Conference Paper

References (16)

1. JK.Lenstra, AHG.Kan, P.Brucker, Complexity of machine scheduling problem, Annals of Discrete Mathematics , 1997,pp. 343-362.
2. Fisher H, Thompson G L, "Probability learning combinations of local job shop scheduling rules," Industrial Scheduling, 1963,pp.225-251.
3. HOLLAND J H, Genetic algorithm, Scientific American. vol.266, 1992,pp. 44-50.
4. L. Davis, "Job shop scheduling with genetic algorithms," Proceedings of the first International Conference on Genetic Algorithms, Lawrence Erbaum Associates, 1985, pp. 136-1405.
5. Xiao mei Yang, Jian chao Zeng, "Apply inversion order number Genetic Algorithm to the Job Shop Scheduling Problem," 2009 Third International Conference on Genetic and Evolutionary Computing,2009,pp.196-200.
6. Ye Li, Yan Chen, "A G enetic Algorithm for Job Shop Scheduling," Journal of software,2010,pp.269-274.
7. Byung Joo Park, Hyung Rim Choi, Hyun Soo Kim, "A Hybrid Genetic Algorithm for the Job Shop Scheduling Problems," Computers & Industrial Engineering, Vol.4, 2003, pp.597-613,
8. Dirk C. Mattfeld, Christian Bierwirth, "An efficient genetic algorithm for job shop scheduling with tardiness objectives," European Journal of Operational Research,2004,pp.616-630.
9. Masato Watanabe, Kenichi Idab, Mitsuo Gen, "A genetic algorithm with modified crossover operator and search area adaptation for the job shop scheduling problem," Computers & Industrial Engineering, 2005,pp. 743-752.
10. Someya H, Yamamura M, "Genetic algorithm with search area adaptation for the function optimization and its experimental analysis". Proceedings of IEEE, 2001, pp.933-940.
11. Lou Xiao fang, Zou Feng xing, "An improved genetic algorithm for Job shop scheduling problem," 2009 Chinese Control and Decision Conference,2009,pp.2595-2598.
12. Wang L, Zheng D, "An effective hybrid optimisation strategy for jobshop scheduling problems". Computers & Operations Research 2001,pp.585-596.
13. E Balas, "Machine sequencing via disjunctive graphs: An implicit enumeration algorithm," Operations research, 1969,pp.941-950.
14. Mauro Dell'Amico, Marco Trubian, "Applying tabu search to the job shop scheduling problem," Annals of operation research,1993,pp.231-252.
15. Lawrence S, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, GSIA,Carnegie-mellom university,1984.
16. Van Laarhoven PJM, Aarts EHL, Lenstra JK, "Job shop scheduling by simulated annealing," Operations Research, vol.40,1992, pp.113-125.