Back to University of Twente portal
Tabu search for the job-shop scheduling problem with multi-purpose machines
Hurink, J.L. and Jurisch, B. and Thole, M. (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spectrum, 15 (4). pp. 205-215. ISSN 0171-6468
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 1083Kb |
| Abstract: | 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. |
| Item Type: | Article |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/66534 |
| Official URL: | http://www.springerlink.com/content/q7474w04pl018210 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page