Ten notes on equal-processing-time scheduling: At the frontiers of solvability in polynomial time

DC ElementWertSprache
dc.contributor.authorBaptiste, P.
dc.contributor.authorBrucker, P.
dc.contributor.authorKnust, S.
dc.contributor.authorTimkovsky, V.G.
dc.date.accessioned2021-12-23T16:28:20Z-
dc.date.available2021-12-23T16:28:20Z-
dc.date.issued2004
dc.identifier.issn16194500
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/15788-
dc.description.abstractEqual-processing-time scheduling problems whose complexity status has been unknown are shown to be solved in polynomial time by well-known and relatively new techniques. Single-machine, parallel-machine, parallel-batch, openshop, flow-shop and job-shop environments are touched upon. © Springer-Verlag 2004.
dc.language.isoen
dc.publisherSpringer Verlag
dc.relation.ispartof4OR
dc.subjectComputational complexity
dc.subjectPolynomial time
dc.subjectScheduling
dc.titleTen notes on equal-processing-time scheduling: At the frontiers of solvability in polynomial time
dc.typejournal article
dc.identifier.doi10.1007/s10288-003-0024-4
dc.identifier.scopus2-s2.0-84891641042
dc.identifier.urlhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84891641042&doi=10.1007%2fs10288-003-0024-4&partnerID=40&md5=ed220fbaefdae9de6ce7a21e8d879ac5
dc.description.volume2
dc.description.issue2
dc.description.startpage111
dc.description.endpage127
dcterms.isPartOf.abbreviation4OR
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidKnSi808-
Zur Kurzanzeige

Seitenaufrufe

4
Letzte Woche
0
Letzter Monat
2
geprüft am 01.06.2024

Google ScholarTM

Prüfen

Altmetric