New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints.
Péter GyörgyiTamás KisPublished in: Discret. Appl. Math. (2022)
Keyphrases
- single machine
- resource constraints
- weighted number of tardy jobs
- scheduling problem
- resource constrained
- processing times
- maximum lateness
- total weighted tardiness
- release dates
- release times
- completion times
- earliness tardiness
- temporal constraints
- sequence dependent setup times
- scheduling jobs
- learning effect
- setup times
- competitive ratio
- worst case
- single machine scheduling problem
- computational complexity
- precedence constraints
- identical machines
- np hard
- special case