Scheduling non-preemptible jobs to minimize peak demand

DOI10.3390/a10040122zbMath1461.90060OpenAlexW2758283679MaRDI QIDQ2633192

Brendan Mumey, Sean Yaw

Publication date: 8 May 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a10040122

zbMATH Keywords

approximation algorithmsjob schedulingsmart gridpeak demand minimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Uses Software

• REDD

Cites Work

• Unnamed Item
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Average-case performance analysis of a 2D strip packing algorithm -- NFDH
• An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling
• Shelf Algorithms for Two-Dimensional Packing Problems

This page was built for publication: Scheduling non-preemptible jobs to minimize peak demand