A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling

A. El-Bouri, N. Azizi, S. Zolfaghari

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

In this study, a general framework is proposed that combines the distinctive features of three well-known approaches: the adaptive memory programming, the simulated annealing, and the tabu search methods. Four variants of a heuristic based on this framework are developed and presented. The performance of the proposed methods is evaluated and compared with a conventional simulated annealing approach using benchmark problems for job shop scheduling. The unique feature of the proposed framework is the use of two short-term memories. The first memory temporarily prevents further changes in the configuration of a provisional solution by maintaining the presence of good elements of such solutions. The purpose of the second memory is to keep track of good solutions found during an iteration, so that the best of these can be used as the starting point in a subsequent iteration. Our computational results for the job shop scheduling problem clearly indicate that the proposed methods significantly outperform the conventional simulated annealing.

Original languageEnglish
Pages (from-to)1894-1910
Number of pages17
JournalEuropean Journal of Operational Research
Volume177
Issue number3
DOIs
Publication statusPublished - Mar 16 2007

    Fingerprint

Keywords

  • Adaptive memory programming
  • Job shop scheduling
  • Meta-heuristics
  • Simulated annealing
  • Tabu search

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this