Algorithm 1 Algorithm for appliance scheduling

Variables:  $R$: collection of requests  $k$: request where $k\in R$  $I(k)$: theoretical appliance power consumption corresponding to request $k$  $pwr$: total power consumption of accepted requests  $L$: maximum power consumption threshold Goal: Initialize the request set $\left(R\right)$ in descending order of heuristic value   $pwr=0$   for all $k\in R$ do    if task is non-preemptive and operational then     accept request $k$     remove request $k$ from $R$     $pwr=pwr+I\left(k\right)$    end if   end for   for all $k\in R$ do    if $pwr+I\left(k\right)\le L$ and request $k$ is operational then     accept request $k$     remove request $k$ from $R$     $pwr=pwr+I\left(k\right)$    end if   end for   for all $k\in R$ do    if $pwr+I\left(k\right)\le L$ then     accept request $k$     remove request $k$ from $R$     $pwr=pwr+I\left(k\right)$    end if   end for