Improved dynamic programs for some batching problems involving the maximum lateness criterion.
Albert P. M. WagelmansAlex E. GerodimosPublished in: Oper. Res. Lett. (2000)
Keyphrases
- problems involving
- maximum lateness
- single machine
- scheduling problem
- release dates
- precedence constraints
- flowshop
- sequence dependent setup times
- multiple objectives
- solving complex
- branch and bound algorithm
- single machine scheduling problem
- setup times
- optimization problems
- lower bound
- neural network
- cost function
- reinforcement learning