Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem.
Lei ShangMichele GarraffaFederico Della CroceVincent T'kindtPublished in: IPEC (2017)
Keyphrases
- single machine
- scheduling problem
- total tardiness
- competitive ratio
- total weighted tardiness
- np hard
- parallel machines
- sequence dependent setup times
- single machine scheduling problem
- dynamic programming
- setup times
- processing times
- earliness tardiness
- search tree
- release times
- maximum lateness
- job shop scheduling problem
- search space
- tabu search
- scheduling jobs
- release dates
- flowshop
- evolutionary algorithm
- strongly np hard
- optimal solution
- computational complexity
- simulated annealing
- special case
- completion times
- linear programming
- particle swarm optimization