Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach.
Marco GhirardiChris N. PottsPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- unrelated parallel machines
- beam search
- parallel machines
- scheduling problem
- setup times
- flowshop
- heuristic search
- sequence dependent setup times
- search algorithm
- processing times
- branch and bound
- precedence constraints
- single machine
- release dates
- search methods
- job shop scheduling problem
- parallel computing
- single server
- tabu search
- shared memory
- job shop
- single machine scheduling problem
- probabilistic model
- branch and bound algorithm