Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks.
Asma LahimerPierre LopezMohamed HaouariPublished in: CPAIOR (2011)
Keyphrases
- scheduling problem
- flowshop
- single machine
- processing times
- setup times
- search algorithm
- tabu search
- np hard
- job shop
- job shop scheduling problem
- bicriteria
- precedence constraints
- minimizing makespan
- flowshop scheduling
- total tardiness
- maximum lateness
- job shop scheduling
- unrelated parallel machines
- search space
- parallel machines
- special case
- sequence dependent setup times
- search problems
- open shop
- memetic algorithm
- combinatorial optimization
- lot streaming
- flowshop scheduling problems