An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm

Tai-Yue Wang, Kuei Bin Wu

研究成果: Article同行評審

9 引文 斯高帕斯(Scopus)

摘要

This paper uses the simulated annealing algorithm to solve job shop scheduling problems, thereby minimizing the total tardiness. Also presented here is a configuration generation mechanism capable of excluding all of the infeasible configurations beforehand. Doing so allows us to increase the efficiency of the annealing process. In addition, the simulated annealing algorithm is compared with a more tailored algorithm (MEHA), indicating that the solution quality of the former significantly outperforms the latter. Moreover, the simulated annealing algorithm, although using more computational time than MEHA, has a high solution quality and can be easily implemented.

原文English
頁(從 - 到)527-532
頁數6
期刊International Journal of Systems Science
30
發行號5
DOIs
出版狀態Published - 1999 一月 1

All Science Journal Classification (ASJC) codes

  • 控制與系統工程
  • 理論電腦科學
  • 電腦科學應用

指紋

深入研究「An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm」主題。共同形成了獨特的指紋。

引用此