Weighted tardiness for the single machine scheduling problem: An examination of precedence theorem productivity.
John J. KanetC. BirkemeierPublished in: Comput. Oper. Res. (2013)
Keyphrases
- weighted tardiness
- single machine scheduling problem
- precedence constraints
- scheduling problem
- branch and bound algorithm
- release dates
- sequence dependent setup times
- single machine
- setup times
- parallel machines
- partial order
- processing times
- minimize total
- approximation algorithms
- combinatorial optimization
- partially ordered
- global constraints
- resource consumption
- hybrid algorithm
- np hard
- tabu search
- lower bound
- job shop scheduling problem
- optimization problems
- upper bound