Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times.
Vinícius Amaral ArmentanoOlinto César Bassi de AraújoPublished in: J. Heuristics (2006)
Keyphrases
- setup times
- sequence dependent setup times
- precedence constraints
- scheduling problem
- processing times
- single machine scheduling problem
- flowshop
- tabu search
- single machine
- branch and bound algorithm
- parallel machines
- release dates
- multi item
- completion times
- lot sizing
- identical parallel machines
- np hard
- global constraints
- special case
- search procedure
- partially ordered
- branch and bound
- combinatorial optimization
- lower bound
- optimal solution
- approximation algorithms
- state space
- strongly np hard