Relative value function approximation for the capacitated re-entrant line scheduling problem.
Jin Young ChoiSpyros A. ReveliotisPublished in: IEEE Trans Autom. Sci. Eng. (2005)
Keyphrases
- scheduling problem
- flowshop
- np hard
- minimizing makespan
- single machine
- minimizing total tardiness
- processing times
- tabu search
- sequence dependent setup times
- setup times
- permutation flowshop
- basis functions
- precedence constraints
- special case
- lower bound
- multi item
- vehicle routing problem
- approximate dynamic programming
- temporal difference
- single source
- routing problem
- manufacturing systems
- release dates
- multi period
- upper bound
- state space