JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES
| Autor(en): | BRUCKER, P SCHLIE, R |
Stichwörter: | Computer Science; Computer Science, Theory & Methods; FLEXIBLE MANUFACTURING; JOB-SHOP SCHEDULING; SHORTEST PATH | Erscheinungsdatum: | 1990 | Herausgeber: | SPRINGER-VERLAG WIEN | Journal: | COMPUTING | Volumen: | 45 | Ausgabe: | 4 | Startseite: | 369 | Seitenende: | 375 | Zusammenfassung: | Consider the following generalization of the classical job-shop scheduling problem in which a set of machines is associated with each operation of a job. The operation can be processed on any of the machines in this set. For each assignment mu of operations to machines let P(mu) be the corresponding job-shop problem and f(mu) be the minimum makespan of P(mu). How to find an assignment which minimizes f(mu)? For problems with two jobs a polynomial algorithm is derived. |
ISSN: | 0010485X | DOI: | 10.1007/BF02238804 |
Zur Langanzeige
Seitenaufrufe
361
Letzte Woche
6
6
Letzter Monat
33
33
geprüft am 19.05.2024
