Tabu search algorithm for minimizing the makespan in a job shop scheduling

M. A. Al-Fawzan*, K. S. Al-Sultan

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

3 Scopus citations

Abstract

In this paper, a new heuristic method for solving the n-job m-machine job shop scheduling problem is presented. The objective is to minimize the makespan. This method is based on the Tabu Search technique, an iterative improvement approach to combinatorial optimization problems. Preliminary computational experiences with the proposed algorithm are very encouraging.

Original languageEnglish
Pages115-119
Number of pages5
StatePublished - 1996

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'Tabu search algorithm for minimizing the makespan in a job shop scheduling'. Together they form a unique fingerprint.

Cite this