A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work.
Mikhail Y. KovalyovChris N. PottsLuk N. Van WassenhovePublished in: Math. Oper. Res. (1994)
Keyphrases
- minimize total
- single machine
- scheduling problem
- release dates
- weighted tardiness
- completion times
- processing times
- maximum lateness
- release times
- shortest processing time
- scheduling jobs
- sequence dependent setup times
- dynamic programming
- setup times
- single machine scheduling problem
- parallel machines
- total cost
- np hard
- precedence constraints