Maximizing Availability: A Commitment Heuristic for Oversubscribed Scheduling Problems.
Laurence A. KramerStephen F. SmithPublished in: ICAPS (2005)
Keyphrases
- scheduling problem
- sequencing problems
- list scheduling
- tabu search
- job shop scheduling problem
- single machine
- quay crane
- np hard
- parallel machine scheduling problem
- optimal solution
- strongly np hard
- processing times
- squeaky wheel
- randomly generated test problems
- graph search
- job shop scheduling
- flowshop
- setup times
- search algorithm
- combinatorial optimization
- simulated annealing
- search procedure
- heuristic function
- precedence constraints
- beam search
- search problems
- greedy heuristic
- parallel machines
- job shop
- greedy algorithm
- parallel genetic algorithm
- constraint satisfaction
- graph coloring problems
- dynamic programming
- special case