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.
| Original language | English |
|---|---|
| Pages (from-to) | 205-215 |
| Number of pages | 11 |
| Journal | OR Spectrum = OR Spektrum |
| Volume | 15 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Feb 1994 |
