Sign up & Download
Sign in

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

by Johann Hurink, Bernd Jurisch, Monika Thole
OR Spektrum ()

Abstract

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.

Cite this document (BETA)

Readership Statistics

18 Readers on Mendeley
by Discipline
 
 
 
by Academic Status
 
61% Ph.D. Student
 
11% Assistant Professor
 
11% Doctoral Student
by Country
 
6% Switzerland
 
6% Germany
 
6% Egypt

Tags

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!

Already have an account? Sign in