A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | BRUCKER, P | |
dc.contributor.author | JURISCH, B | |
dc.contributor.author | SIEVERS, B | |
dc.date.accessioned | 2021-12-23T15:58:49Z | - |
dc.date.available | 2021-12-23T15:58:49Z | - |
dc.date.issued | 1994 | |
dc.identifier.issn | 0166218X | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/3579 | - |
dc.description.abstract | 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. | |
dc.language.iso | en | |
dc.publisher | ELSEVIER SCIENCE BV | |
dc.relation.ispartof | DISCRETE APPLIED MATHEMATICS | |
dc.subject | BRANCH AND BOUND METHOD | |
dc.subject | DATES | |
dc.subject | JOB-SHOP SCHEDULING | |
dc.subject | Mathematics | |
dc.subject | Mathematics, Applied | |
dc.title | A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM | |
dc.type | journal article | |
dc.identifier.doi | 10.1016/0166-218X(94)90204-6 | |
dc.identifier.isi | ISI:A1994NJ99700008 | |
dc.description.volume | 49 | |
dc.description.issue | 1-3 | |
dc.description.startpage | 107 | |
dc.description.endpage | 127 | |
dc.publisher.place | PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS | |
dcterms.isPartOf.abbreviation | Discret Appl. Math. | |
dcterms.oaStatus | Bronze |
Seitenaufrufe
1
Letzte Woche
0
0
Letzter Monat
1
1
geprüft am 06.06.2024