Approximate dynamic programming for an energy-efficient parallel machine scheduling problem
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,...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Elsevier
2021
|
| Online Access: | http://purl.org/au-research/grants/arc/IC180100030 http://hdl.handle.net/20.500.11937/87326 |