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

by Johann Hurink, Bernd Jurisch, Monika Thole
ORSpektm ()


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

Cite this document (BETA)

Readership Statistics

25 Readers on Mendeley
by Discipline
by Academic Status
56% Ph.D. Student
8% Doctoral Student
8% Student (Master)
by Country
4% Germany
4% Switzerland
4% Portugal

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Sign up & Download

Already have an account? Sign in