Scheduling non-preemptible jobs to minimize peak demand
From MaRDI portal
Publication:2633192
DOI10.3390/A10040122zbMATH Open1461.90060OpenAlexW2758283679MaRDI QIDQ2633192FDOQ2633192
Publication date: 8 May 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a10040122
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
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
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)
