Parallel dedicated machine scheduling with conflict graphs

•Scheduling with conflicts subject to fixed job sequences is introduced.•Complexity status is investigated.•Dynamic programming algorithms are developed. This paper investigates a variant of parallel-machine scheduling problems with conflict constraints. A set of identical parallel machines is avail...

Celý popis

Podrobná bibliografia

Vydané v:	Computers & industrial engineering Ročník 124; s. 316 - 321
Hlavní autori:	Hong, Huai-Che, Lin, Bertrand M.T.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.10.2018
Predmet:	Conflict graph Dynamic programming Fixed sequences NP-hardness Parallel dedicated machines Conflict graph NP-hardness Parallel dedicated machines Dynamic programming Fixed sequences
ISSN:	0360-8352, 1879-0550
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!