Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains.
George SteinerRui ZhangPublished in: J. Sched. (2009)
Keyphrases
- approximation algorithms
- supply chain
- number of late jobs
- completion times
- release times
- single machine
- scheduling problem
- np hard
- single machine scheduling problem
- precedence constraints
- weighted sum
- special case
- processing times
- flowshop
- lead time
- release dates
- primal dual
- facility location problem
- worst case
- decision making
- holding cost
- vehicle routing problem
- queue length
- branch and bound algorithm
- polynomial time approximation
- travel time
- planning horizon
- setup times