A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM

DC ElementWertSprache
dc.contributor.authorBRUCKER, P
dc.contributor.authorJURISCH, B
dc.contributor.authorSIEVERS, B
dc.date.accessioned2021-12-23T15:58:49Z-
dc.date.available2021-12-23T15:58:49Z-
dc.date.issued1994
dc.identifier.issn0166218X
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/3579-
dc.description.abstractA 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.isoen
dc.publisherELSEVIER SCIENCE BV
dc.relation.ispartofDISCRETE APPLIED MATHEMATICS
dc.subjectBRANCH AND BOUND METHOD
dc.subjectDATES
dc.subjectJOB-SHOP SCHEDULING
dc.subjectMathematics
dc.subjectMathematics, Applied
dc.titleA BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM
dc.typejournal article
dc.identifier.doi10.1016/0166-218X(94)90204-6
dc.identifier.isiISI:A1994NJ99700008
dc.description.volume49
dc.description.issue1-3
dc.description.startpage107
dc.description.endpage127
dc.publisher.placePO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
dcterms.isPartOf.abbreviationDiscret Appl. Math.
dcterms.oaStatusBronze
Zur Kurzanzeige

Seitenaufrufe

1
Letzte Woche
0
Letzter Monat
1
geprüft am 06.06.2024

Google ScholarTM

Prüfen

Altmetric