Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack.
Hans KellererVitaly A. StrusevichPublished in: Int. J. Found. Comput. Sci. (2010)
Keyphrases
- single machine
- earliness tardiness
- completion times
- weighted number of tardy jobs
- scheduling problem
- release times
- dynamic programming
- processing times
- single machine scheduling problem
- total weighted tardiness
- release dates
- parallel machines
- number of late jobs
- objective function
- weighted sum
- knapsack problem
- computational complexity
- asymptotically optimal
- flowshop
- search algorithm