Resource cost aware scheduling (Q1750475)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Resource cost aware scheduling	scientific article

Statements

scholarly article

0 references

Resource cost aware scheduling (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.ejor.2018.02.059

0 references

Rodrigo A. Carrasco

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

22 May 2018

0 references

full work available at URL

https://arxiv.org/abs/1110.0685

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

scheduling

0 references

approximation algorithms

0 references

resource aware scheduling

0 references

speed-scaling

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Energy-efficient algorithms for flow time minimization

0 references

Speed Scaling to Manage Temperature

0 references

Average Rate Speed Scaling

0 references

Scheduling for Speed Bounded Processors

0 references

0 references

Speed scaling to manage energy and temperature

0 references

0 references

0 references

Approximation Techniques for Average Completion Time Scheduling

0 references

Algorithms and Data Structures

0 references

Single machine batch scheduling with resource dependent setup and processing times

0 references

Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

0 references

A multi-objective approach to resource allocation in single machine scheduling

0 references

Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

0 references

0 references

Single Machine Scheduling with Release Dates

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

0 references

0 references

Project scheduling under uncertainty: survey and research potentials

0 references

Algorithms for power savings

0 references

0 references

Single machine scheduling problem with a common deadline and resource dependent release dates

0 references

Single machine scheduling subject to deadlines and resource dependent processing times

0 references

A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

0 references

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

0 references

Minimizing average completion time in the presence of release dates

0 references

0 references

Speed scaling of tasks with precedence constraints

0 references

Getting the best response for your erg

0 references

Minimizing the total weighted flow time in a single machine with controllable processing times

0 references

A survey of scheduling with controllable processing times

0 references

A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates

0 references

List Scheduling in Order of α-Points on a Single Machine

0 references

A bicriterion approach to time/cost trade-offs in sequencing

0 references

Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine

0 references

Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time

0 references

Single machine scheduling with total tardiness criterion and convex controllable processing times

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1750475

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1750475&oldid=36391337"