2017
DOI: 10.1080/00207543.2017.1414969
|View full text |Cite
|
Sign up to set email alerts
|

Production scheduling optimisation with machine state and time-dependent energy costs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 53 publications
(22 citation statements)
references
References 31 publications
0
21
0
1
Order By: Relevance
“…The auxiliary variables γ i,t connect the constraints Equations (8) and (9). The constraints Equation (10) provide that the value of ε t is not less than the consumption of the EGS energy in the slot t. The variables ε t are used in the Equation ( 5) representing total cost of the energy which value is minimised.…”
Section: Discrete-time Linear Programming Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…The auxiliary variables γ i,t connect the constraints Equations (8) and (9). The constraints Equation (10) provide that the value of ε t is not less than the consumption of the EGS energy in the slot t. The variables ε t are used in the Equation ( 5) representing total cost of the energy which value is minimised.…”
Section: Discrete-time Linear Programming Modelmentioning
confidence: 99%
“…In the first group, there are works concerning the optimisation based on schedule-dependent energy cost of the production [3][4][5][6][7]. In particular, the manufacturing with machines of variable speed [8,9] or having multiple working states [10][11][12][13] is considered in this group, where the speed or state determines instantaneous machine power consumption and the related cost. The second group includes problems related to manufacturing cost optimisation under time-of-use (TOU) price tariffs of EGS energy.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…So for single machine scheduling problems, Aghelinejad et al [25] proposed a dynamic programming approach to solve these problems by using a finite graph. A non-preemptive single-machine manufacturing environment had been investigated by Aghelinejad et al [26] to reduce the total costs. They Improved the mathematical formulation of scheduling problem in a predetermined order at machine level to process the jobs.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Aghelinejad vd. [20] ve Zhang vd. [21], sezgisel algoritma önermişlerdir.…”
Section: Gi̇ri̇ş (Introduction)unclassified