Scheduling chains with identical jobs and constant delays on a single machine

DC ElementWertSprache
dc.contributor.authorBrucker, P
dc.contributor.authorKnust, S
dc.contributor.authorOguz, C
dc.date.accessioned2021-12-23T16:09:02Z-
dc.date.available2021-12-23T16:09:02Z-
dc.date.issued2006
dc.identifier.issn14322994
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/8582-
dc.description.abstractn 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.isoen
dc.publisherSPRINGER HEIDELBERG
dc.relation.ispartofMATHEMATICAL METHODS OF OPERATIONS RESEARCH
dc.subjectcomplexity results
dc.subjectdelays
dc.subjectMathematics
dc.subjectMathematics, Applied
dc.subjectOperations Research & Management Science
dc.subjectscheduling
dc.subjectTIME-LAGS
dc.titleScheduling chains with identical jobs and constant delays on a single machine
dc.typejournal article
dc.identifier.doi10.1007/s00186-005-0014-8
dc.identifier.isiISI:000235113900004
dc.description.volume63
dc.description.issue1
dc.description.startpage63
dc.description.endpage75
dc.contributor.orcid0000-0003-0994-1758
dc.contributor.researcheridF-5158-2011
dc.identifier.eissn14325217
dc.publisher.placeTIERGARTENSTRASSE 17, D-69121 HEIDELBERG, GERMANY
dcterms.isPartOf.abbreviationMath. Method Oper. Res.
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidKnSi808-
Zur Kurzanzeige

Seitenaufrufe

2
Letzte Woche
0
Letzter Monat
2
geprüft am 07.06.2024

Google ScholarTM

Prüfen

Altmetric