Improved simulated annealing algorithm used for job shop scheduling problems

Advances in Intelligent and Soft Computing

Volumn 139 AISC, Issue , 2012, Pages 17-25

  Song, Shao Zhong ^a   Ren, Jia Jun ^b   Fan, Jia Xu ^b  

^a JILIN BUSINESS AND TECHNOLOGY COLLEGE   (China)

^b JILIN UNIVERSITY   (China)

Author keywords

job shop scheduling; optimization solution; simulated annealing algorithm

Indexed keywords

IMPROVED SIMULATED ANNEALING ALGORITHM; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; MEAN COMPLETION TIME; OPTIMAL COMPLETION; OPTIMIZATION SOLUTION; SHOP SCHEDULING; SIMULATED ANNEALING ALGORITHMS;

ELECTRICAL ENGINEERING;

OPTIMIZATION;

EID: 84860316469     PISSN: 18675662     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-27951-5_3     Document Type: Conference Paper

References (6)

1. Demirkol, E., Mehta, S., Uzsoy, R.: Benchmarks for shop scheduling problems. European Journal of Operational Research 109, 137-141 (1998)
2. Ruiz, R., Garcia-Diaz, J.C., Maroto, C.: Considering scheduling and preventive maintenance in the flow-shop sequencing problem. Computers & Operations Research 34, 3314-3330 (2007)
3. Xiao, S., Lu, H., Fan, A., Song, H.: Applied Research of Simulated Annealing Algorithm on Solving Combinatoria1 Optimization Problems. Journal of Sichuan University of Science & Engineering (Natural Science Edition) 23, 116-118 (2010)
4. Tao, Q., Zou, Q.: Simulated annealing algorithm for two dimensional placement problems. Journal of Hunan University of Arts and Science (Science and Technology) 21, 11-13 (2009)
5. Pinedo, M., Zhang, Z. (translation).: Scheduling theory, algorithms and systems, 2nd edn. Tsinghua University Press (2007)
6. Wu, Q., Qiao, F., Li, L., Wang, Z.: Semiconductor manufacturing systems scheduling. Electronic Industry Press (2006)