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

Job Shop Scheduling
Computer programming
Simulated annealing
Simulated Annealing
Comparative Study
scheduling
heuristics
Programming
programming
Heuristics
Data storage equipment
Iteration
Job Shop Scheduling Problem
Memory Term
Tabu Search
Search Methods
tabu
Computational Results
Tabu search
Benchmark

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

A comparative study of a new heuristic based on adaptive memory programming and simulated annealing : The case of job shop scheduling. / El-Bouri, A.; Azizi, N.; Zolfaghari, S.

In: European Journal of Operational Research, Vol. 177, No. 3, 16.03.2007, p. 1894-1910.

Research output: Contribution to journalArticle

@article{2ab57942493446fb9055123a9eb3e9f5,
title = "A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling",
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.",
keywords = "Adaptive memory programming, Job shop scheduling, Meta-heuristics, Simulated annealing, Tabu search",
author = "A. El-Bouri and N. Azizi and S. Zolfaghari",
year = "2007",
month = "3",
day = "16",
doi = "10.1016/j.ejor.2005.12.013",
language = "English",
volume = "177",
pages = "1894--1910",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - A comparative study of a new heuristic based on adaptive memory programming and simulated annealing

T2 - The case of job shop scheduling

AU - El-Bouri, A.

AU - Azizi, N.

AU - Zolfaghari, S.

PY - 2007/3/16

Y1 - 2007/3/16

N2 - 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.

AB - 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.

KW - Adaptive memory programming

KW - Job shop scheduling

KW - Meta-heuristics

KW - Simulated annealing

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=33750736617&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750736617&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2005.12.013

DO - 10.1016/j.ejor.2005.12.013

M3 - Article

AN - SCOPUS:33750736617

VL - 177

SP - 1894

EP - 1910

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -