An exact algorithm for non-preemptive peak demand job scheduling
From MaRDI portal
Recommendations
- Scheduling non-preemptible jobs to minimize peak demand
- Optimal nonpreemptive scheduling in a smart grid model
- Offline first-fit decreasing height scheduling of power loads
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization
- iGreen: green scheduling for peak demand minimization
Cites work
- Average-case performance analysis of a 2D strip packing algorithm -- NFDH
- DVS scheduling in a line or a star network of processors
- Energy Efficient Scheduling of Parallelizable Jobs
- From preemptive to non-preemptive speed-scaling scheduling
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- scientific article; zbMATH DE number 2163021 (Why is no real title available?)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Non-preemptive Speed Scaling
- Shelf Algorithms for Two-Dimensional Packing Problems
Cited in
(3)
This page was built for publication: An exact algorithm for non-preemptive peak demand job scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942377)