Optimal Scheduling of Domestic Appliances via MILP
نویسندگان
چکیده
This paper analyzes a consumption scheduling mechanism for domestic appliances within a home area network. The aim of the proposed scheduling is to minimize the total energy price paid by the consumer and to reduce power peaks in order to achieve a balanced daily load schedule. An exact and computationally efficient mixed-integer linear programming (MILP) formulation of the problem is presented. This model is verified by several problem instances. Realistic scenarios based on the real price tariffs commercially available in the Czech Republic are calculated. The results obtained by solving the optimization problem are compared with a simulation of the ripple control service currently used by many domestic consumers in the Czech Republic.
منابع مشابه
Scheduling of Residential Multiclass Appliances in Smart Homes UsingV2H Capability of Electric Vehicle
With the aim of reducing cost of electricity consumption and peak load reduction, tools requirement for better managing electricity consumption have become inevitable in recent years. Smart home has some equipment which are controllable and this ability is used for increasing comfort and minimizing electricity cost for residence. As a key component of smart home , Electric Vehicle(EV) ,increase...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملEnergy and CO2 efficient scheduling of smart appliances in active houses equipped with batteries
In this paper, we present a novel method for scheduling smart appliances and batteries, in order to reduce both the electricity bill and the CO2 emissions. Mathematically, the scheduling problem is posed as a multi-objective Mixed Integer Linear Programming (MILP), which can be solved by using standard algorithms. A case study is performed to assess the performance of the proposed scheduling fr...
متن کاملTest Scheduling for Core-Based Systems1
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and is therefore NP-complete. However, a commonly-encountered instance of this problem (m = 2) can be solved in polynomial time. For the general case (m > 2), we present a mixed-integer linear programming (MILP) model for ...
متن کاملAccepted for Publication in Ieee Transactions on Computer-aided Design of Integrated Circuits and Systems Test Scheduling for Core-based Systems Using Mixed-integer Linear Programming
We present optimal solutions to the test scheduling problem for core-based systems. Given a set of tasks (test sets for the cores), a set of test resources (e.g. test buses, BIST hardware) and a test access architecture, we determine start times for the tasks such that the total test application time is minimized. We show that the test scheduling decision problem is equivalent to the m-processo...
متن کامل