Minimizing Total Tardiness on a Single Machine with Precedence Constraints.
Joseph Y.-T. LeungGilbert H. YoungPublished in: INFORMS J. Comput. (1990)
Keyphrases
- precedence constraints
- sequence dependent setup times
- single machine
- scheduling problem
- maximum lateness
- release dates
- flowshop
- single machine scheduling problem
- total tardiness
- parallel machines
- processing times
- branch and bound algorithm
- setup times
- scheduling jobs
- approximation algorithms
- release times
- np hard
- identical parallel machines
- competitive ratio
- strongly np hard
- identical machines
- tabu search
- global constraints
- partial order
- partially ordered
- completion times
- special case