iGreen: green scheduling for peak demand minimization
From MaRDI portal
Publication:1675631
DOI10.1007/s10898-017-0524-yzbMath1380.90131OpenAlexW2606654401MaRDI QIDQ1675631
Zhao Zhang, Shaojie Tang, Jing Yuan, Ding-Zhu Du
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0524-y
Cites Work
- Unnamed Item
- A \((5/3+\varepsilon)\)-approximation for strip packing
- Flowshop/no-idle scheduling to minimize total elapsed time
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
- Interval scheduling on identical machines
- Machine scheduling with an availability constraint
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- An Exact Approach to the Strip-Packing Problem
- Peak Shaving through Resource Buffering
- Shelf Algorithms for Two-Dimensional Packing Problems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- The Competitiveness of On-Line Assignments
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
