Hybrid flow-shop scheduling problems with multiprocessor task systems.
Ceyda OguzYakov ZinderVan Ha DoAdam JaniakMaciej LichtensteinPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- scheduling problem
- flowshop
- single machine
- setup times
- np hard
- tabu search
- processing times
- sequence dependent setup times
- job shop
- job shop scheduling problem
- maximum lateness
- flowshop scheduling
- makespan minimization
- bicriteria
- precedence constraints
- minimizing makespan
- job shop scheduling
- permutation flowshop
- total tardiness
- unrelated parallel machines
- neural network
- asymptotic optimality
- total weighted tardiness
- parallel machines
- complex systems
- special case
- single machine scheduling problem
- constraint satisfaction problems