From preemptive to non-preemptive speed-scaling scheduling (Q479009): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B25 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6377036 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximation algorithms | |||
Property / zbMATH Keywords: approximation algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
speed-scaling | |||
Property / zbMATH Keywords: speed-scaling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
non-preemptive scheduling | |||
Property / zbMATH Keywords: non-preemptive scheduling / rank | |||
Normal rank |
Revision as of 18:45, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | From preemptive to non-preemptive speed-scaling scheduling |
scientific article |
Statements
From preemptive to non-preemptive speed-scaling scheduling (English)
0 references
5 December 2014
0 references
approximation algorithms
0 references
speed-scaling
0 references
non-preemptive scheduling
0 references