2020
DOI: 10.3390/en13195034
|View full text |Cite
|
Sign up to set email alerts
|

Energy Cost-Efficient Task Positioning in Manufacturing Systems

Abstract: A problem to determine a production schedule which minimises the cost of energy used for manufacturing is studied. The scenario assumes that each production task has assigned constant power consumption, price of power from conventional electrical grid system is defined by time-of-use tariffs, and a component of free of charge renewable energy is available for the manufacturing system. The objective is to find the most cost-efficient production plan, subject to constraints involving predefined precedence relati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 32 publications
(60 reference statements)
0
1
0
Order By: Relevance
“…We have chosen two mathematical programming techniques, namely MILP and constraint programming, which are widely used for hard optimization problems. We have also implemented the tabu search metaheuristic which can often overperform mathematical programming solvers due to use of problem encoding dedicated directly for a specific case [19,20]. Finally, we have developed deterministic algorithms based on greedy or heuristic rules which are guided by locally defined optima rather than the global objective function; hence, they may be less efficient at objective minimization, but competitive in industrial applications due to simple implementation and low computational complexity.…”
Section: General Casementioning
confidence: 99%
See 3 more Smart Citations
“…We have chosen two mathematical programming techniques, namely MILP and constraint programming, which are widely used for hard optimization problems. We have also implemented the tabu search metaheuristic which can often overperform mathematical programming solvers due to use of problem encoding dedicated directly for a specific case [19,20]. Finally, we have developed deterministic algorithms based on greedy or heuristic rules which are guided by locally defined optima rather than the global objective function; hence, they may be less efficient at objective minimization, but competitive in industrial applications due to simple implementation and low computational complexity.…”
Section: General Casementioning
confidence: 99%
“…, r q } ⊆ R are to be transferred in the k-th consecutive frame. As a consequence, the constraints (23) obtain the form r k ≤ r i and r k ≥ r i for i ∈ I k , which implies that the value r q − r p + 1 will be assigned to ω k , according to (20). There are expressions (20) reserved for the maximum possible number of frames equal to n, but not all of them are needed in a typical solution, and then κ n < n. In such a case, no constraints are activated for r k , r k with k > κ n , according to (23).…”
Section: Constraint Programmingmentioning
confidence: 99%
See 2 more Smart Citations
“…The growing cost of energy is one of the most important factors related to the cost of production, therefore the literature considers various ways to solve this problem, e.g., production of renewable energy [3], prosumer parallel production and consumption of energy [4], local electricity trading [5], flexible distribution of energy in the smart grid [6], modern energy saving technologies [7], and intelligent energy management in the whole supply chain [8][9][10][11].…”
Section: Introductionmentioning
confidence: 99%