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...

Full description

Bibliographic Details

Published in:	Computers & industrial engineering Vol. 124; pp. 316 - 321
Main Authors:	Hong, Huai-Che, Lin, Bertrand M.T.
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.10.2018
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!