.png){kind=icon}
返回
Approximate dynamic programming for an energy-efficient parallel machine scheduling problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2021.12.041.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose an approximate dynamic programming approach for an energy-efficient unrelated parallel machine scheduling problem. In this scheduling problem, jobs arrive at the system randomly, and each job's ready and processing times become available when an order is placed. Therefore, we consider the online version of the problem. Our objective is to minimize a combination of makespan and the total energy costs. The energy costs include cost of energy consumption of machines for switching on, processing, and idleness. We propose a binary program to solve the optimization problem at each stage of the approximate dynamic program. We compare the results of the approximate programming approach against an integer linear programming formulation of the offline version of the scheduling problem and an existing heuristic method suitable for scheduling problem with ready times. The results show that the approximate dynamic programming algorithm outperforms the two off-line methods in terms of solution quality and computational time. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Approximate dynamic programming
Energy-efficient production planning
Makespan
Time-of-use tariff
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Zygotene-Pachytene Substaging and Synaptonemal Complex Karyotyping of Boar Spermatocytes.png)
Hereditas
HereditasIF0
PREAI
分享收藏分享收藏Bi-criteria single-machine batch scheduling with machine on/off switching under time-of-use tariffs
PREAI
分享收藏
查看更多内容