Journal article

Tabu search for the job-shop scheduling problem with multi-purpose machines

Hurink J, Jurisch B, Thole M ...see all

OR Spektrum, vol. 15, issue 4 (1994) pp. 205-215 Published by Springer-Verlag

  • 42


    Mendeley users who have this article in their library.
  • 189


    Citations of this article.
Sign in to save reference


In this paper we study the following generaliza- tion of the job-shop scheduling problem. Each operation can be performed by one machine out of a set of machines given for this operation. The processing time does not depend on the machine which has been chosen for processing the operation. This problem arises in the area of flexible manufacturing. As a generalization of the job- shop problem it belongs to the hardest problems in combinatorial optimization. We show that an application of tabu search techniques to this problem yields excellent results for benchmark problems.

Author-supplied keywords

  • Job-shop scheduling
  • flexible manufacturing
  • tabu search

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free