Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks
Asma LahimerPierre LopezMohamed HaouariPublished in: CoRR (2011)
Keyphrases
- scheduling problem
- flowshop
- single machine
- processing times
- job shop
- special case
- setup times
- maximum lateness
- search algorithm
- tabu search
- bicriteria
- np hard
- sequence dependent setup times
- strongly np hard
- minimizing makespan
- flowshop scheduling
- makespan minimization
- precedence constraints
- job shop scheduling
- asymptotic optimality
- permutation flowshop
- open shop
- search problems
- search space
- total tardiness
- search procedure
- flowshop scheduling problems
- unrelated parallel machines
- total weighted tardiness
- release dates
- completion times
- resource constrained
- job shop scheduling problem
- dynamic programming
- evolutionary algorithm