SSRN Electronic Journal,
Journal Year:
2024,
Volume and Issue:
unknown
Published: Jan. 1, 2024
In
this
paper
we
consider
the
problem
of
scheduling
two
types
home
appliances:
ones
with
fixed
power
and
flexible
operation
time
others
power.
We
energy
consumption
bounds
that
depend
on
day,
which
modify
considerably
computational
complexity
appliance
problems.
Additionally,
also
take
into
account
possibility
appliances
could
be
interrupted.
The
goal
decision-making
process
is
to
minimize
electricity
bill
paid
by
users
discomfort
perceived
them,
according
a
desired-tradeoff,
subject
restrictions
involved.
Since
these
problems
turn
out
NP-hard,
describe
several
heuristics
designed,
explaining
their
foundations.
Finally,
analyze
results
obtained
for
instances
generated
present
best
algorithms
employ
different
priorities
might
have.
SSRN Electronic Journal,
Journal Year:
2024,
Volume and Issue:
unknown
Published: Jan. 1, 2024
In
this
paper
we
consider
the
problem
of
scheduling
two
types
home
appliances:
ones
with
fixed
power
and
flexible
operation
time
others
power.
We
energy
consumption
bounds
that
depend
on
day,
which
modify
considerably
computational
complexity
appliance
problems.
Additionally,
also
take
into
account
possibility
appliances
could
be
interrupted.
The
goal
decision-making
process
is
to
minimize
electricity
bill
paid
by
users
discomfort
perceived
them,
according
a
desired-tradeoff,
subject
restrictions
involved.
Since
these
problems
turn
out
NP-hard,
describe
several
heuristics
designed,
explaining
their
foundations.
Finally,
analyze
results
obtained
for
instances
generated
present
best
algorithms
employ
different
priorities
might
have.
