A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date.
Hans KellererVitaly A. StrusevichPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- single machine
- total tardiness
- scheduling problem
- minimize total
- completion times
- processing times
- sequence dependent setup times
- total weighted tardiness
- shortest processing time
- number of late jobs
- release dates
- release times
- scheduling jobs
- learning effect
- single machine scheduling problem
- dynamic programming
- setup times
- objective function
- tabu search
- linear programming