Offline first-fit decreasing height scheduling of power loads

DOI10.1007/S10951-017-0528-YzbMath1391.90306OpenAlexW2702194203MaRDI QIDQ1707831

Anshu Ranjan, Sartaj K. Sahni, Pramod P. Khargonekar

Publication date: 4 April 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-017-0528-y

zbMATH Keywords

schedulingapproximation algorithmabsolute worst-case ratiopreemption with resume

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Lower bounds on the performance of online algorithms for relaxed packing problems ⋮ Asymptotically optimal scheduling of random malleable demands in smart grid

Cites Work

• Resource constrained scheduling as generalized bin packing
• Two-dimensional packing problems: a survey
• Smart-Grid Electricity Allocation via Strip Packing with Slicing
• Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: Offline first-fit decreasing height scheduling of power loads