Minimizing total weighted flow time of a set of jobs with interval processing times.
Yuri N. SotskovNatalja G. EgorovaTsung-Chyan LaiPublished in: Math. Comput. Model. (2009)
Keyphrases
- processing times
- completion times
- single machine
- number of tardy jobs
- polynomially solvable
- scheduling problem
- release times
- single machine scheduling problem
- release dates
- identical machines
- setup times
- scheduling jobs
- total weighted tardiness
- fixed number
- flowshop
- competitive ratio
- scheduling decisions
- makespan minimization
- response time
- job processing times
- upper bound