IOS integration (IOSI) is becoming a competitive necessity in an industrial environment that emphasizes competition between supply chains. In the supply chain, dominant firms often try to exert their power to influence their dependent firms to implement IOSI. Misunderstanding about how power operates will impede firms for developing IOSI. Based on the circuits of power framework and the concept...

Distribution systems can be operated in multiple configurations since they are possible combinations of radial and loop feeders. Each configuration leads to its own power losses and reliability level of supplying electric energy to customers. In order to obtain the optimal configuration of power networks, their reconfiguration is formulated as a complex optimization problem with different objec...

We consider the first, and most well studied, speed scaling problem in the algorithmic literature: where the scheduling quality of service measure is a deadline feasibility constraint, and where the power objective is to minimize the total energy used. Four online algorithms for this problem have been proposed in the algorithmic literature. Based on the best upper bound that can be proved on th...

This paper studies the impact of Time-Of-Use (TOU) tariffs in a competitive electricity market place. Specifically, it focuses on the question of how should an autonomous broker agent optimize TOU tariffs in a competitive retail market, and what is the impact of such tariffs on the economy. We formalize the problem of TOU tariff optimization and propose an algorithm for approximating its soluti...

Abstract We consider the first, and most well studied, speed scaling problem in the algorithmic literature: where the scheduling quality of service measure is a deadline feasibility constraint, and where the power objective is to minimize the total energy used. Four online algorithms for this problem have been proposed in the algorithmic literature. Based on the best upper bound that can be pro...

This paper discusses online power aware routing in large wireless ad-hoc networks for applications where the message sequence is not known. We seek to optimize the lifetime of the network. We show that online power-aware routing does not have a constant competitive ratio to the off-line optimal algorithm. We develop an approximation algorithm called max-min zPmin that has a good empirical compe...