Minimizing the Number of Tardy Jobs with Precedence Constraints and Agreeable Due Dates.
George SteinerPublished in: Discret. Appl. Math. (1997)
Keyphrases
- number of tardy jobs
- precedence constraints
- processing times
- scheduling problem
- single machine scheduling problem
- precedence relations
- single machine
- release dates
- flowshop
- branch and bound algorithm
- parallel machines
- np hard
- partially ordered
- vertex cover
- approximation algorithms
- partial order
- unit length
- resource consumption
- completion times
- global constraints
- partially ordered sets
- branch and bound