Relative value function approximation for the capacitated re-entrant line scheduling problem: an experimental investigation.
Jin Young ChoiSpyros A. ReveliotisPublished in: CDC (2004)
Keyphrases
- scheduling problem
- flowshop
- np hard
- minimizing makespan
- single machine
- minimizing total tardiness
- lot sizing
- tabu search
- processing times
- setup times
- single source
- vehicle routing problem
- permutation flowshop
- sequence dependent setup times
- basis functions
- routing problem
- precedence constraints
- facility location
- parallel machines
- multi item
- network flow problem
- minimum cost
- approximation algorithms
- lower bound
- multi source
- search algorithm
- integer programming
- manufacturing systems
- release dates
- linear program
- linear programming
- multi commodity
- special case