A Hybrid Heuristic for Scheduling a Hybrid Flowshop Maximum Completion Time Problem.
Fouad RianeAbdelhakim ArtibaPublished in: ICONIP (2) (1997)
Keyphrases
- scheduling problem
- flowshop
- preventive maintenance
- single machine
- parallel machines
- sequence dependent setup times
- maximum lateness
- setup times
- minimizing makespan
- processing times
- minimizing total tardiness
- job shop
- np hard
- flowshop scheduling
- bicriteria
- total tardiness
- unrelated parallel machines
- precedence constraints
- makespan minimization
- flowshop scheduling problems
- dispatching rule
- number of tardy jobs
- release dates
- tabu search
- job processing times
- job shop scheduling problem
- permutation flowshop
- special case
- robotic cell