HAL CCSD
Energy efficient scheduling problems under Time-Of-Use tariffs with different energy consumption of the jobs
Aghelinejad, Mohammadmohsen
Ouazene, Yassine
Yalaoui, Alice
Laboratoire d'Optimisation des Systèmes Industriels (LOSI) ; Institut Charles Delaunay (ICD) ; Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)
International audience
ISSN: 2405-8963
IFAC-PapersOnLine
Elsevier
hal-02493409
https://utt.hal.science/hal-02493409
https://utt.hal.science/hal-02493409
IFAC-PapersOnLine, 2018, 51 (11), pp.1053-1058. ⟨10.1016/j.ifacol.2018.08.468⟩
DOI: 10.1016/j.ifacol.2018.08.468
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ifacol.2018.08.468
en
Energy efficiency
Time of use electricity tariffs
Non-preemption
Single machine scheduling
Dynamic programming approach
Speed scalable problem
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
info:eu-repo/semantics/article
Journal articles
This paper deals with single machine scheduling problems, where the machine may be in processing, idle or off state. The machine consumes a different amount of energy in function of its state. Moreover, during processing (ON state), the energy consumption depends on the job. The complexity of these problems, when the jobs’ sequence is fix, for the uniform-speed problem and the speed-scalable problem are analyzed. For this purpose, a dynamic programming approach is proposed to solve these problems by using a finite graph. The results demonstrate that the uniform-speed problem is polynomial of degree 3, and its speed-scalable case is pseudo polynomial.
2018