Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals.
Valery S. GordonFrank WernerO. A. YanushkevichPublished in: RAIRO Oper. Res. (2001)
Keyphrases
- single machine to minimize
- number of late jobs
- single machine
- completion times
- tardiness cost
- release times
- scheduling problem
- total weighted tardiness
- total tardiness
- processing times
- release dates
- learning effect
- response time
- sequence dependent setup times
- single machine scheduling problem
- competitive ratio
- scheduling jobs
- dynamic programming
- weighted sum
- flowshop