An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling

DOI10.1007/978-3-319-12691-3_1zbMath1431.90072OpenAlexW118525741MaRDI QIDQ2942377

Brendan Mumey, Sean Yaw

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_1

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Scheduling non-preemptible jobs to minimize peak demand ⋮ Non-preemptive scheduling in a smart grid model and its implications on machine minimization

Cites Work

• Unnamed Item
• Unnamed Item
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• Average-case performance analysis of a 2D strip packing algorithm -- NFDH
• Non-preemptive Speed Scaling
• Shelf Algorithms for Two-Dimensional Packing Problems
• DVS Scheduling in a Line or a Star Network of Processors
• From Preemptive to Non-preemptive Speed-Scaling Scheduling
• Energy Efficient Scheduling of Parallelizable Jobs

This page was built for publication: An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling