A note on makespan minimization in two-stage flexible flow shops with uniform machines.
George J. KyparisisChristos KoulamasPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- makespan minimization
- parallel machines
- flowshop
- scheduling problem
- processing times
- special case
- job shop scheduling problem
- single machine
- total weighted tardiness
- metaheuristic
- sequence dependent setup times
- release dates
- precedence constraints
- setup times
- tabu search
- shared memory
- polynomial time approximation
- single server
- optimal solution
- linear programming
- np hard
- search algorithm