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

Tai-Yue Wang, Kuei Bin Wu

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)527-532
Number of pages6
JournalInternational Journal of Systems Science
Volume30
Issue number5
DOIs
Publication statusPublished - 1999 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 'An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm'. Together they form a unique fingerprint.

  • Cite this