Solution of job-shop scheduling problems by an idle time shortening genetic algorithm

Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)

Volumn 159, Issue 2, 2007, Pages 55-63

  Ida, Kenichi ^a   Osawa, Akira ^b  

^a MAEBASHI INSTITUTE OF TECHNOLOGY   (Japan)

^b Nisseicom Ltd   (Japan)

Author keywords

Genetic algorithm; Idle time; Job shop scheduling problem; Left shift

Indexed keywords

GENETIC ALGORITHMS; PROBLEM SOLVING;

IDLE TIME; JOB SHOP SCHEDULING PROBLEM; LEFT SHIFT;

JOB ANALYSIS;

EID: 33947231317     PISSN: 04247760     EISSN: 15206416     Source Type: Journal    
DOI: 10.1002/eej.20389     Document Type: Article

References (16)

1. Ida K, Osawa A. A solution to JSP by GA using idle time shortening algorithm. Reprints of 2004 Spring JIMA Conf, p 130-131.
2. Ida K, Osawa A. Job-shop scheduling problem using genetic algorithm. Proc 33rd International Conference on Computers and Industrial Engineering, No. CIE732. CD-ROM, p 1-6, 2004.
3. Ida K, Osawa A. A solution to job-shop scheduling problem by idle time shortening type GA. Reports of 2004 IEEJ Conf on Electronics, Information, and Systems, p 481-485.
4. Ida K, Osawa A. A genetic algorithm with algorithm shortening idle time for job shop scheduling problem. Proc SCIS & ISIS 2004, No.THP-7-2, CD-ROM, p 1-5.
5. Yamada T, Nakano R. Job-shop scheduling by genetic local search. IPSJ 1997;38:1126-1138. (in Japanese)
6. Ida K, Watanabe M, Gen M. A genetic algorithm with modified crossover operator and search area adaptation for job-shop scheduling problem. Proc 30th International Conference on Computers and Industrial Engineering, Vol. 1, p389-394, 2002.
7. Watanebe M, Ida K, Gen M. Active solution and active solution space on job-shop scheduling problem. IEEJ Trans EIS 2004; 124:1626-1634. (in Japanese)
8. Hirano H. Genetic algorithms with cluster averaging method for solving job-shop scheduling problems. JSAI 1995;10:769-777. (in Japanese)
9. Beasley JE. OR-Library. http://mscmga.ms.ic.ac.uk/jeb/orlib/
10. Mizuta T et al. Effect of mutation in JSP, No. 18, 2002. 〈http://mikilab.doshisha.ac.jp/dia/research/person/taka/meeting/14/ report18.html〉
11. Ono I, Nagata Y, Kobayashi S. A genetic algorithm taking account of characteristics preservation for job shop scheduling problems. Proc International Conference on Intelligent System, Vol. 5, p 711-718, 1998.
12. Yamada T, Nakano R. A genetic algorithm, applicable to large scale job shop scheduling problems. Parallel Problem Solving from Nature, Vol. 2, p 281-290, 1992.
13. Ono I, Satoh H, Kobayashi S. A genetic algorithm based on sub-sequence exchange crossover and GT method for job-shop scheduling. Trans IEE Japan 1997;117-C:888-895. (in Japanese)
14. Ikeda K, Kobayashi S. Innately split model for job-shop scheduling problem. JSAI 2002; 17:530-538. (in Japanese)
15. Yamada T, Nakano R. Job-shop scheduling by simulated annealing combined with deterministic local search. Kluwer Academic; 1995.
16. Applegate D, Cook W. A computational study of the job-shop scheduling problem. ORSA J Comput 1991;3:149-156.