Journal
IFAC PAPERSONLINE
Volume 51, Issue 11, Pages 1053-1058Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ifacol.2018.08.468
Keywords
Energy efficiency; Time of use electricity tariffs; Non-preemption Single machine scheduling; Dynamic programming approach; Speed scalable problem
Categories
Funding
- Champagne-Ardenne region in France
- FEDER (Fonds europen de dveloppement conomique et rgional)
Ask authors/readers for more resources
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. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available