Global and Local Search for Scheduling Job Shop with Parallel Machines

  • Nodari Vakhania
Conference paper

DOI: 10.1007/3-540-44399-1_8

Volume 1952 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Vakhania N. (2000) Global and Local Search for Scheduling Job Shop with Parallel Machines. In: Monard M.C., Sichman J.S. (eds) Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 1952. Springer, Berlin, Heidelberg

Abstract

Classical Job Shop Scheduling problem describes operation in several industries. In this classical model, there is only one machine available for each group of tasks, and the precedence relations between the tasks are restricted to serial-parallel. Here we suggest a generaliza- tion, which allows parallel unrelated machines and arbitrary precedence relations between the tasks. The feasible solution space of the generali- zed problem (which is significantly larger than that of a corresponding version without parallel machines) is efficiently reduced to an essenti- ally smaller subset. The use of this reduced subset, instead of the whole feasible set, is beneficial. We propose global and local search algorithms which start from the reduced solution set.

Key words

scheduling job shop parallel machines search tree global and local search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Nodari Vakhania
    • 1
  1. 1.Facultad de CienciasUniversidad Autónoma del Estado de MorelosCuernavacaMexico