A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems

Tai Yue Wang, Kuei Bin Wu

研究成果: Article同行評審

23 引文 斯高帕斯(Scopus)

摘要

This paper applies a revised configuration generation mechanism of the Simulated Annealing (SA) algorithm to obtain the minimum total tardiness in job shop scheduling problems. In addition to always generating feasible configurations, this revised mechanism can also exclude some cost non-decreasing configurations in advance. The revised SA method is also compared with a more tailored algorithm (MEHA) and two other SA approaches. Computational results indicate that the solution quality of the SA approaches outperform MEHA. Among the three SA approaches, the revised SA has the best performance. Moreover, the SA approaches differ insignificantly in terms of computational time.

原文English
頁(從 - 到)537-542
頁數6
期刊International Journal of Systems Science
31
發行號4
DOIs
出版狀態Published - 2000 一月 1

All Science Journal Classification (ASJC) codes

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

指紋

深入研究「A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems」主題。共同形成了獨特的指紋。

引用此