Abstract

AbstractThe theoretical problems of demand-side management are examined in without regard to the type of resource whose demand is to be managed, and the Maximum Demand problem is identified and addressed in a system consisting of independent processes that consume the resource. It is shown that the Maximum Demand problem generalizes the Santa Fe Bar Problem of game theory, and the basic properties of Maintenance and Strong and Weak Recovery that are desirable of systems of processes where demand management is practiced are defined. Basic algorithms are given for solving the Maximum Demand problem in a general context, and in a system where the processes have priorities.KeywordsMaximum demandSanta Fe Bar Problemmaintenancerecovery

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.