From preemptive to non-preemptive speed-scaling scheduling
type: Item
instance of: scholarly article
title: From preemptive to non-preemptive speed-scaling scheduling
zbMATH Open document ID: 1317.68021
author: Evripidis Bampis
author: Dimitrios Letsios
author: G. Lucarelli
author: Ioannis Nemparis
author: Alexander Kononov
published in: Discrete Applied Mathematics
publication date: 2014-12-05T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 6377036
zbMATH Keywords: approximation algorithms
zbMATH Keywords: speed-scaling
zbMATH Keywords: non-preemptive scheduling
MaRDI profile type: Publication
full work available at URL: j.dam.2014.10.007
OpenAlex ID: W2039509670
cites work: Speed Scaling on Parallel Processors with Migration
cites work: Non-preemptive Speed Scaling
cites work: Q2963934
cites work: Green Scheduling, Flows and Matchings
cites work: Speed Scaling for Maximum Lateness
cites work: Q2934666
cites work: An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
cites work: Scheduling jobs that arrive over time
cites work: Speed scaling of tasks with precedence constraints
cites work: Q4252722
DOI: 10.1016/J.DAM.2014.10.007
description: scientific article; zbMATH DE number 6377036