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

Johann L. Hurink, Bernd Jurisch, Monika Thole

Research output: Contribution to journalArticleAcademicpeer-review

261 Citations (Scopus)
428 Downloads (Pure)


In this paper we study the following generalization 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 jobshop 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.
Original languageUndefined
Article number10.1007/BF01719451
Pages (from-to)205-215
Number of pages11
JournalOR Spectrum = OR Spektrum
Issue number4
Publication statusPublished - Feb 1994


  • IR-66534
  • EWI-7637

Cite this