Approximate dynamic programming for an energy-efficient parallel machine scheduling problem.
Mojtaba HeydarElham MardanehRyan C. LoxtonPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- approximate dynamic programming
- parallel machine scheduling problem
- scheduling problem
- wireless sensor networks
- linear program
- release dates
- dynamic programming
- total weighted tardiness
- parallel machines
- sequence dependent setup times
- reinforcement learning
- single machine
- maximum lateness
- step size
- lagrangian relaxation
- sensor networks
- flowshop
- control policy
- np hard
- single machine scheduling problem
- average cost
- setup times
- linear programming
- job shop
- learning algorithm
- stereo matching
- optimal solution
- simulated annealing
- precedence constraints
- multistage