A grasp-knapsack hybrid for a nurse-scheduling problem.
Melissa D. GoodmanKathryn A. DowslandJonathan M. ThompsonPublished in: J. Heuristics (2009)
Keyphrases
- scheduling problem
- tabu search
- feasible solution
- flowshop
- knapsack problem
- single machine
- grasp with path relinking
- dynamic programming
- setup times
- np hard
- upper bound
- metaheuristic
- permutation flowshop
- minimizing makespan
- parallel machines
- optimal solution
- precedence constraints
- genetic algorithm
- total tardiness
- neural network
- hybrid approaches
- processing times
- information systems
- unrelated parallel machines
- search procedure
- earliness tardiness
- database
- greedy heuristic
- job shop scheduling problem
- real time
- linear programming
- simulated annealing
- search algorithm