On a certain class of power- and energy-related scheduling problems
From MaRDI portal
Publication:2422748
DOI10.1016/j.dam.2018.10.014zbMath1412.68027OpenAlexW2900221766MaRDI QIDQ2422748
Grzegorz Waligóra, Rafal Rózycki
Publication date: 20 June 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.10.014
Cites Work
- Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
- Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
- Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
- Resource level minimization in the discrete-continuous scheduling
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic
- Project Scheduling with Discrete and Continuous Resources
- Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- Time-Optimal Control of Resource Allocation in a Complex of Operations Framework
- Simulated Annealing and Tabu Search for Discrete-Continuous Project Scheduling with Discounted Cash Flows
This page was built for publication: On a certain class of power- and energy-related scheduling problems