Peak Shaving through Resource Buffering
DOI10.1007/978-3-540-93980-1_12zbMATH Open1209.68656OpenAlexW1604683485MaRDI QIDQ3602836FDOQ3602836
Authors: Amotz Bar-Noy, Matthew P. Johnson, Ou Liu 
Publication date: 12 February 2009
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_12
Recommendations
- Algorithms and Computation
- Optimization of demand response through peak shaving
- Peak Demand Minimization via Sliced Strip Packing.
- Peak demand minimization via sliced strip packing
- scientific article; zbMATH DE number 1786151
- Scheduling Resources for Throughput Maximization
- IMPROVED RESOURCE UTILIZATION WITH BUFFERED COSCHEDULING
- Sharing resources at nonuniform access rates
- Buffered Resource Constraint: Algorithms and Complexity
- Adaptive resource allocation to maximize run-out times
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Inventory, storage, reservoirs (90B05)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Production Planning by Mixed Integer Programming
- Dynamic version of the economic lot size model
- Deterministic Production Planning: Algorithms and Complexity
- Capacity acquisition, subcontracting, and lot sizing
- A multi-warehouse inventory model for items with time-varying demand and shortages.
- Optimal Online Algorithms for Minimax Resource Scheduling
- Warehouse sizing to minimize inventory and storage costs
- Optimization of warehouse storage capacity under a dedicated storage policy
Cited In (4)
This page was built for publication: Peak Shaving through Resource Buffering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602836)
