Scheduling non-preemptible jobs to minimize peak demand

DOI10.3390/A10040122MaRDI QIDQ2633192zbMATH OpenOpenAlexFDO

Authors Sean Yaw, Brendan Mumey

Publication date 8 May 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Scheduling jobs with precedence constraints to minimize peak demand
• An exact algorithm for non-preemptive peak demand job scheduling
• Scheduling to Minimize Maximum Workload
• scientific article; zbMATH DE number 1529456
• On Job Scheduling with Preemption Penalties
• Resource Minimization Job Scheduling
• Non-preemptive scheduling to maximize the minimum global inter-completion time
• Scheduling under a Non-renewable Resource Constraint
• Scheduling semi-malleable jobs to minimize mean flow time

Cites work

• scientific article; zbMATH DE number 2163021 (Why is no real title available?)
• An exact algorithm for non-preemptive peak demand job scheduling
• Average-case performance analysis of a 2D strip packing algorithm -- NFDH
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Shelf Algorithms for Two-Dimensional Packing Problems

Cited in

(3)

• Non-preemptive scheduling in a smart grid model and its implications on machine minimization
• iGreen: green scheduling for peak demand minimization
• An exact algorithm for non-preemptive peak demand job scheduling

Describes a project that uses

Uses Software

• REDD

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633192)