Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints

We investigate two parallel dedicated machine scheduling with conflict constraints. The problem of minimizing the makespan has been shown to be NP-hard in the strong sense under the assumption that the processing sequence of jobs on one machine is given and fixed a priori. The problem without any fi...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 941; pp. 167 - 179
Main Authors:	Zhang, An, Zhang, Liang, Chen, Yong, Chen, Guangting, Wang, Xing
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 04.01.2023
Subjects:	Approximation algorithm Conflict graph NP-hard Parallel dedicated machines Conflict graph NP-hard Parallel dedicated machines Approximation algorithm
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!