Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints.
Péter GyörgyiTamás KisPublished in: J. Sched. (2019)
Keyphrases
- single machine
- resource constraints
- weighted number of tardy jobs
- scheduling problem
- completion times
- processing times
- maximum lateness
- release times
- resource constrained
- total weighted tardiness
- release dates
- earliness tardiness
- scheduling jobs
- temporal constraints
- sequence dependent setup times
- routing problem
- competitive ratio
- learning effect
- dynamic programming
- setup times
- single machine scheduling problem
- np hard
- response time
- identical machines
- genetic algorithm
- flowshop