Makespan minimization in a no-wait flow shop problem with two batching machines.
Ammar OulamaraPublished in: Comput. Oper. Res. (2007)
Keyphrases
- makespan minimization
- flowshop
- scheduling problem
- parallel machines
- release dates
- setup times
- precedence constraints
- single machine
- special case
- processing times
- total weighted tardiness
- sequence dependent setup times
- tabu search
- job shop scheduling problem
- single machine scheduling problem
- single server
- parallel computing
- np hard
- job shop