A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem.
Federico Della CroceVincent T'kindtPublished in: J. Oper. Res. Soc. (2002)
Keyphrases
- scheduling problem
- search algorithm
- flowshop
- tabu search
- minimizing makespan
- completion times
- parallel machines
- job processing times
- heuristic search
- single machine
- np hard
- unrelated parallel machines
- hill climbing
- search algorithm for solving
- permutation flowshop
- setup times
- cross section
- approximation algorithms
- logic programs
- search space