Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times.
Asaf LevinTal ShustermanPublished in: Acta Informatica (2023)
Keyphrases
- processing times
- single machine
- preemptive scheduling
- scheduling problem
- completion times
- total weighted tardiness
- scheduling jobs
- earliness tardiness
- release dates
- release times
- single machine scheduling problem
- number of late jobs
- sequence dependent setup times
- total tardiness
- competitive ratio
- setup times
- shortest processing time
- learning effect
- polynomially solvable
- response time
- production scheduling
- identical machines
- makespan minimization
- dynamic programming
- resource consumption
- number of tardy jobs
- computational complexity
- weighted sum
- np complete
- np hard
- flowshop
- job processing times
- special case