A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM
| Autor(en): | BRUCKER, P JURISCH, B SIEVERS, B |
Stichwörter: | BRANCH AND BOUND METHOD; DATES; JOB-SHOP SCHEDULING; Mathematics; Mathematics, Applied | Erscheinungsdatum: | 1994 | Herausgeber: | ELSEVIER SCIENCE BV | Journal: | DISCRETE APPLIED MATHEMATICS | Volumen: | 49 | Ausgabe: | 1-3 | Startseite: | 107 | Seitenende: | 127 | Zusammenfassung: | A fast branch and bound algorithm for the job-shop scheduling problem has been developed. Among other hard problems it solves the 10 x 10 benchmark problem which has been open for more than 20 years. We will give a complete description of this algorithm and will present computational results. |
ISSN: | 0166218X | DOI: | 10.1016/0166-218X(94)90204-6 |
Zur Langanzeige
Seitenaufrufe
1
Letzte Woche
0
0
Letzter Monat
1
1
geprüft am 01.06.2024
