A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop.
Ahmed El-BouriPublished in: Comput. Oper. Res. (2012)
Keyphrases
- scheduling problem
- flowshop
- number of tardy jobs
- cooperative
- single machine
- processing times
- total tardiness
- setup times
- minimizing makespan
- tabu search
- bicriteria
- parallel machines
- flowshop scheduling
- sequence dependent setup times
- np hard
- total weighted tardiness
- flowshop scheduling problems
- dispatching rule
- completion times
- special case
- maximum lateness
- precedence constraints
- production scheduling
- permutation flowshop
- strongly np hard
- resource consumption
- job shop scheduling problem
- integer programming