Author： Wang Tai-Yue Wu Kuei-Bin
Publisher： Taylor & Francis Ltd
ISSN： 1464-5319
Source： International Journal of Systems Science, Vol.31, Iss.4, 2000-04, pp. : 537-542
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
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.
Related content
Access to resources
Recommend
By Jamili Amin Shafia Mohammad Tavakkoli-Moghaddam Reza
The International Journal of Advanced Manufacturing Technology, Vol. 54, Iss. 1-4, 2011-04 ,pp. :