A note on the SPT heuristic for solving scheduling problems with generalized due dates.
Gur MosheiovDaniel OronPublished in: Comput. Oper. Res. (2004)
Keyphrases
- processing times
- scheduling problem
- single machine
- flowshop
- strongly np hard
- asymptotic optimality
- list scheduling
- sequencing problems
- job shop scheduling problem
- graph coloring problems
- tabu search
- setup times
- shortest processing time
- combinatorial optimization
- quay crane
- eigenvalue problems
- job shop scheduling
- np hard
- randomly generated test problems
- timetabling problem
- maximum lateness
- sequence dependent setup times
- variable ordering
- search heuristics
- finding an optimal solution
- single machine scheduling problem
- precedence constraints
- asymptotically optimal
- simulated annealing
- squeaky wheel
- dynamic programming
- search procedure
- search algorithm
- search algorithm for solving
- parallel machine scheduling problem
- sliding tile
- distributed constraint satisfaction problems
- stochastic local search
- graph search
- parallel machines
- combinatorial optimization problems