List scheduling in a parallel machine environment with precedence constraints and setup times

DC ElementWertSprache
dc.contributor.authorHurink, J
dc.contributor.authorKnust, S
dc.date.accessioned2021-12-23T16:09:40Z-
dc.date.available2021-12-23T16:09:40Z-
dc.date.issued2001
dc.identifier.issn01676377
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/8925-
dc.description.abstractWe present complexity results which have influence on the strength of list scheduling in a parallel machine environment where additional precedence constraints and sequence-dependent setup times are given and the makespan has to be minimized. We show that contrary to various other scheduling problems, in this environment a set of dominant schedules cannot be calculated efficiently with list scheduling techniques. (C) 2002 Elsevier Science B.V. All rights reserved.
dc.language.isoen
dc.publisherELSEVIER SCIENCE BV
dc.relation.ispartofOPERATIONS RESEARCH LETTERS
dc.subjectcomplexity
dc.subjectlist scheduling
dc.subjectOperations Research & Management Science
dc.subjectparallel machines
dc.subjectscheduling
dc.subjectsetup times
dc.titleList scheduling in a parallel machine environment with precedence constraints and setup times
dc.typejournal article
dc.identifier.doi10.1016/S0167-6377(01)00104-3
dc.identifier.isiISI:000173552400006
dc.description.volume29
dc.description.issue5
dc.description.startpage231
dc.description.endpage239
dc.contributor.orcid0000-0001-6986-5633
dc.contributor.researcheridI-4491-2019
dc.publisher.placePO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
dcterms.isPartOf.abbreviationOper. Res. Lett.
dcterms.oaStatusGreen Submitted
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidKnSi808-
Zur Kurzanzeige

Seitenaufrufe

9
Letzte Woche
0
Letzter Monat
6
geprüft am 01.06.2024

Google ScholarTM

Prüfen

Altmetric