Scheduling chains with identical jobs and constant delays on a single machine
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Brucker, P | |
dc.contributor.author | Knust, S | |
dc.contributor.author | Oguz, C | |
dc.date.accessioned | 2021-12-23T16:09:02Z | - |
dc.date.available | 2021-12-23T16:09:02Z | - |
dc.date.issued | 2006 | |
dc.identifier.issn | 14322994 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/8582 | - |
dc.description.abstract | n this paper we study the single-machine problem 1 vertical bar chains(1), p(j) = p vertical bar Sigma C-j in which jobs with constant processing times and generalized precedence constraints in form of chains with constant delays are given. One has to schedule the jobs on a single machine such that all delays between consecutive jobs in a chain are satisfied and the sum of all completion times of the jobs is minimized. We show that this problem is polynomially solvable. | |
dc.language.iso | en | |
dc.publisher | SPRINGER HEIDELBERG | |
dc.relation.ispartof | MATHEMATICAL METHODS OF OPERATIONS RESEARCH | |
dc.subject | complexity results | |
dc.subject | delays | |
dc.subject | Mathematics | |
dc.subject | Mathematics, Applied | |
dc.subject | Operations Research & Management Science | |
dc.subject | scheduling | |
dc.subject | TIME-LAGS | |
dc.title | Scheduling chains with identical jobs and constant delays on a single machine | |
dc.type | journal article | |
dc.identifier.doi | 10.1007/s00186-005-0014-8 | |
dc.identifier.isi | ISI:000235113900004 | |
dc.description.volume | 63 | |
dc.description.issue | 1 | |
dc.description.startpage | 63 | |
dc.description.endpage | 75 | |
dc.contributor.orcid | 0000-0003-0994-1758 | |
dc.contributor.researcherid | F-5158-2011 | |
dc.identifier.eissn | 14325217 | |
dc.publisher.place | TIERGARTENSTRASSE 17, D-69121 HEIDELBERG, GERMANY | |
dcterms.isPartOf.abbreviation | Math. Method Oper. Res. | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | KnSi808 | - |
Seitenaufrufe
2
Letzte Woche
0
0
Letzter Monat
2
2
geprüft am 07.06.2024