Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (12): 2963-2967.

Previous Articles     Next Articles

Research on optimization algorithm for multiprocessor scheduling problem based on simulated annealing

LI Kai1,2, ZUO Chun-rong1,2   

  1. 1. School of Management, Hefei Univ. of Technology, Hefei 230009, China; 2. Key Lab. of Process Optimization and Intelligent Decisionmaking, Ministry of Education, Hefei 230009, China
  • Online:2009-12-24 Published:2010-01-03

PDF (PC)

Abstract:

This paper considers the multiprocessor scheduling problem to minimize makespan. This problem is proved to be an NPhard problem. The limitation of the existing simulated annealing algorithm is analyzed, and then a simulated annealing algorithm, named SALZ, is proposed to obtain nearoptimal solutions with high quality. A large set of randomly generated instances are made to test the performance and efficiency of SALZ. Computational results demonstrate that the proposed algorithm is very accurate and outperforms the existing methods.

[an error occurred while processing this directive]