Preemptive Hybrid Flowshop Scheduling problem of interval orders.
Housni DjellabKhaled DjellabPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- scheduling problem
- flowshop
- single machine
- processing times
- minimizing total tardiness
- tabu search
- minimizing makespan
- sequence dependent setup times
- np hard
- setup times
- precedence constraints
- bicriteria
- total flowtime
- total tardiness
- flowshop scheduling
- permutation flowshop
- total weighted tardiness
- maximum lateness
- unrelated parallel machines
- parallel machines
- release dates
- job shop scheduling problem
- strongly np hard
- preventive maintenance
- flowshop scheduling problems
- single machine scheduling problem
- maximum tardiness
- dynamic programming