Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
Guohua WanBenjamin P.-C. YenChung-Lun LiPublished in: Inf. Process. Lett. (2001)
Keyphrases
- minimize total
- single machine scheduling
- single machine scheduling problem
- total cost
- release dates
- np hard
- single machine
- scheduling problem
- optimal solution
- branch and bound algorithm
- minimum cost
- processing times
- precedence constraints
- parallel machines
- approximation algorithms
- resource consumption
- lower bound
- special case
- linear programming
- integer programming
- branch and bound
- lagrangian relaxation
- setup cost
- cost sensitive
- misclassification costs
- lead time
- holding cost