Scheduling non-preemptible jobs to minimize peak demand

DOI10.3390/A10040122zbMATH Open1461.90060OpenAlexW2758283679MaRDI QIDQ2633192FDOQ2633192

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)

Cites Work

• Shelf Algorithms for Two-Dimensional Packing Problems
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• 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
• Title not available (Why is that?)
• Average-case performance analysis of a 2D strip packing algorithm -- NFDH
• An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling

Uses Software

• REDD

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)