Makespan minimization for flow-shop problems with transportation times and a single robot.
Johann L. HurinkSigrid KnustPublished in: Discret. Appl. Math. (2001)
Keyphrases
- flowshop
- makespan minimization
- scheduling problem
- job shop scheduling problem
- processing times
- metaheuristic
- special case
- tabu search
- parallel machines
- flowshop scheduling problems
- polynomially solvable
- job shop scheduling
- benchmark problems
- sequence dependent setup times
- total weighted tardiness
- single machine
- optimization problems
- combinatorial optimization
- np complete
- setup times
- job shop
- ant colony optimization
- polynomial time approximation
- job processing times
- np hard