Search
Abstract
We consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
Citations
-
9
CrossRef
-
0
Web of Science
-
1 5
Scopus
Authors (2)
-
Hanna Furmańczyk
- Wydział MFI, UG Instytut Informatyki
Cite as
Full text
download paper
downloaded 25 times
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.dam.2016.01.036
- License
- Copyright (2016 Elsevier B.V.)
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
DISCRETE APPLIED MATHEMATICS
no. 234,
pages 210 - 217,
ISSN: 0166-218X - Language:
- English
- Publication year:
- 2018
- Bibliographic description:
- Furmańczyk H., Kubale M.: Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines// DISCRETE APPLIED MATHEMATICS. -Vol. 234, (2018), s.210-217
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.dam.2016.01.036
- Verified by:
- Gdańsk University of Technology
seen 131 times