W-prize-collecting scheduling problem on a single machine.
Ruiqing SunBin DengPublished in: CSAI (2022)
Keyphrases
- single machine
- prize collecting
- scheduling problem
- single machine scheduling problem
- processing times
- earliness tardiness
- total weighted tardiness
- total tardiness
- maximum lateness
- release dates
- minimize total
- flowshop
- sequence dependent setup times
- release times
- scheduling jobs
- precedence constraints
- setup times
- tabu search
- weighted tardiness
- travel time
- np hard
- production scheduling
- weighted number of tardy jobs
- job shop
- parallel machines
- dynamic programming
- minimizing makespan
- completion times
- job shop scheduling problem
- computational complexity
- competitive ratio
- makespan minimization
- special case
- deteriorating jobs
- lower bound