Ten notes on equal-processing-time scheduling: At the frontiers of solvability in polynomial time
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Baptiste, P. | |
dc.contributor.author | Brucker, P. | |
dc.contributor.author | Knust, S. | |
dc.contributor.author | Timkovsky, V.G. | |
dc.date.accessioned | 2021-12-23T16:28:20Z | - |
dc.date.available | 2021-12-23T16:28:20Z | - |
dc.date.issued | 2004 | |
dc.identifier.issn | 16194500 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/15788 | - |
dc.description.abstract | Equal-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.iso | en | |
dc.publisher | Springer Verlag | |
dc.relation.ispartof | 4OR | |
dc.subject | Computational complexity | |
dc.subject | Polynomial time | |
dc.subject | Scheduling | |
dc.title | Ten notes on equal-processing-time scheduling: At the frontiers of solvability in polynomial time | |
dc.type | journal article | |
dc.identifier.doi | 10.1007/s10288-003-0024-4 | |
dc.identifier.scopus | 2-s2.0-84891641042 | |
dc.identifier.url | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84891641042&doi=10.1007%2fs10288-003-0024-4&partnerID=40&md5=ed220fbaefdae9de6ce7a21e8d879ac5 | |
dc.description.volume | 2 | |
dc.description.issue | 2 | |
dc.description.startpage | 111 | |
dc.description.endpage | 127 | |
dcterms.isPartOf.abbreviation | 4OR | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | KnSi808 | - |
Seitenaufrufe
4
Letzte Woche
0
0
Letzter Monat
2
2
geprüft am 01.06.2024