From preemptive to non-preemptive speed-scaling scheduling

From preemptive to non-preemptive speed-scaling scheduling Full article

Journal

Discrete Applied Mathematics
ISSN: 0166-218X

Output data

Year: 2014, Volume: 181, Pages: 11-20 Pages count : 10 DOI: 10.1016/j.dam.2014.10.007

Tags

Approximation algorithms; Non-preemptive scheduling; Speed-scaling

Authors

Bampis Evripidis ¹ , Kononov Alexander ² , Letsios Dimitrios ^1,3 , Lucarelli Giorgio ^1,3 , Nemparis Ioannis ^1,4

Affiliations

1	LIP6, Université Pierre et Marie Curie, France
2	Sobolev Institute of Mathematics, Novosibirsk, Russia
3	IBISC, Université d’Évry, France
4	Department of Informatics and Telecommunications, NKUA, Athens, Greece

Bampis E. , Kononov A. , Letsios D. , Lucarelli G. , Nemparis I.
From preemptive to non-preemptive speed-scaling scheduling
Discrete Applied Mathematics. 2014. V.181. P.11-20. DOI: 10.1016/j.dam.2014.10.007 WOS Scopus OpenAlex

Submitted:	Nov 9, 2013
Accepted:	Oct 9, 2014
Published print:	Oct 28, 2014
Published online:	Oct 28, 2014

Web of science:	WOS:000347364700002
Scopus:	2-s2.0-84919469963
OpenAlex:	W2039509670

DB	Citing
Scopus	15
OpenAlex	36
Web of science	13