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

Tai Yue Wang, Kuei Bin Wu

Research output: Contribution to journalArticlepeer-review

23 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)537-542
Number of pages6
JournalInternational Journal of Systems Science
Volume31
Issue number4
DOIs
Publication statusPublished - 2000 Jan 1

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications

Fingerprint Dive into the research topics of 'A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems'. Together they form a unique fingerprint.

Cite this