A flexible flowshop problem with total flow time minimization.
Meral AzizogluErgin ÇakmakSuna Kondakci KöksalanPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- flowshop
- scheduling problem
- flowshop scheduling
- minimizing makespan
- flowshop scheduling problems
- job processing times
- bicriteria
- special case
- processing times
- completion times
- setup times
- sequence dependent setup times
- robotic cell
- total tardiness
- maximum lateness
- preventive maintenance
- tabu search
- objective function
- minimizing total tardiness
- np hard
- single machine
- makespan minimization
- precedence constraints
- lot streaming
- permutation flowshop
- strongly np hard
- efficient solutions
- search algorithm