2015
DOI: 10.1007/s10479-015-2003-5
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling on a single machine under time-of-use electricity tariffs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
49
0
2

Year Published

2016
2016
2020
2020

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 109 publications
(51 citation statements)
references
References 23 publications
0
49
0
2
Order By: Relevance
“…To specifically reduce the energy cost under ToUP, a greedy insertion heuristic was proposed in (Che et al, 2016) for a single machine scheduling model, such that it yielded high-quality solutions within 10 sec even for the instance with 5000 jobs. Fang et al (2016) further investigated the same scheduling problem under the cases of uniform and scalable machine speeds.…”
Section: Energy-efficient Production Schedulingmentioning
confidence: 99%
“…To specifically reduce the energy cost under ToUP, a greedy insertion heuristic was proposed in (Che et al, 2016) for a single machine scheduling model, such that it yielded high-quality solutions within 10 sec even for the instance with 5000 jobs. Fang et al (2016) further investigated the same scheduling problem under the cases of uniform and scalable machine speeds.…”
Section: Energy-efficient Production Schedulingmentioning
confidence: 99%
“…Yao et al, 1995;Pruhs et al, 2008;Kwon and Kim, 2005;Angel et al, 2012) or in manufacturing systems (e.g. Fang et al, 2011Fang et al, , 2014Dai et al, 2013;Fang and Lin, 2013;Liu and Huang, 2014), while others have examined scheduling problems with powerdown mechanism of machines (e.g. Mouzon and Yildirim, 2008;Dai et al, 2013;Pach et al, 2014).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Note that the Problem U-pyr is the same as our problem. Based on Fang et al [29], Che et al [9] investigated a continuous-time MILP model for Problem U-pyr and developed a greedy insertion heuristic algorithm(GIH) that is the most classic method for this problem until now, according to our best knowledge. In their algorithm, the jobs are inserted into available periods with lower electricity prices in sequence, and the jobs with higher power consumption rates are mostly assigned to periods with lower electricity prices by traversing all non-full "forward blocks" and "backward blocks".…”
Section: Introductionmentioning
confidence: 99%
“…However, Fang et al [29] did not establish a complete mathematical model for the single machine scheduling problem (Problem U-pyr) under TOU electricity tariffs, and their algorithm is only feasible in the condition that all the jobs have the same workload and the TOU tariffs follow a so-called pyramidal structure. Regrettably, the TOU electricity tariffs rarely follow a complete pyramidal structure in most provinces in China.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation