A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows.
Alix Munier KordonPublished in: Discret. Appl. Math. (2021)
Keyphrases
- parallel machines
- search space
- dynamic programming
- np hard
- scheduling problem
- unrelated parallel machines
- computational complexity
- simulated annealing
- matching algorithm
- parallel implementation
- list scheduling
- objective function
- open shop
- sequence dependent setup times
- minimize total
- particle swarm optimization
- worst case
- probabilistic model
- special case
- search algorithm