Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget (Q3004675): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_27 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W26049317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with resource dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Task Scheduling in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed scaling of tasks with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules / rank
 
Normal rank

Latest revision as of 03:35, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
scientific article

    Statements

    Identifiers