Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines

Hanna Furmańczyk , Marek Kubale

Abstract

n/a
Author Hanna Furmańczyk (FMPI / II)
Hanna Furmańczyk,,
- Institute of Informatics
, Marek Kubale
Marek Kubale,,
-
Journal seriesDiscrete Applied Mathematics, ISSN 0166-218X, (A 25 pkt)
Issue year2018
Vol234
Pages210-217
Publication size in sheets0.5
Keywords in Englishcubic graph, equitable coloring, NP-hardness, polynomial algorithm, scheduling, uniform machine
ASJC Classification2604 Applied Mathematics; 2607 Discrete Mathematics and Combinatorics
DOIDOI:10.1016/j.dam.2016.01.036
URL https://doi.org/10.1016/j.dam.2016.01.036
Languageen angielski
Score (nominal)25
Score sourcejournalList
ScoreMinisterial score = 25.0, 26-02-2020, ArticleFromJournal
Publication indicators WoS Citations = 7; Scopus SNIP (Source Normalised Impact per Paper): 2018 = 1.263; WoS Impact Factor: 2018 = 0.983 (2) - 2018=1.029 (5)
Citation count*11 (2020-04-06)
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back
Confirmation
Are you sure?