An Analytical Investigation of the Scheduling Problem for Capacitated Re-Entrant Lines.
Jin Young ChoiSpyros A. ReveliotisPublished in: ICRA (2002)
Keyphrases
- scheduling problem
- flowshop
- np hard
- minimizing makespan
- single machine
- minimizing total tardiness
- tabu search
- setup times
- special case
- vehicle routing problem
- lot sizing
- processing times
- permutation flowshop
- parallel machines
- multi item
- sequence dependent setup times
- line drawings
- single source
- line segments
- facility location problem
- routing problem
- hough transform
- network design problem
- network flow problem
- lower bound
- capacity constraints
- precedence constraints
- branch and bound algorithm
- straight line
- linear programming
- facility location
- multi period
- multistage
- minimum cost
- integer programming
- optimal solution