New bounds for single-machine time-dependent scheduling with uniform deterioration.
Angelos GkikasDimitrios LetsiosTomasz RadzikKathleen SteinhöfelPublished in: Theor. Comput. Sci. (2024)
Keyphrases
- single machine
- scheduling problem
- deteriorating jobs
- minimize total
- release times
- release dates
- maximum lateness
- scheduling jobs
- sequence dependent setup times
- weighted tardiness
- earliness tardiness
- total weighted tardiness
- identical machines
- processing times
- production scheduling
- upper bound
- total tardiness
- lower bound
- parallel machines
- setup times
- rolling horizon
- worst case
- learning effect
- precedence constraints
- np hard
- number of late jobs
- job shop
- error bounds
- competitive ratio
- job shop scheduling
- single machine scheduling problem
- job processing times
- weighted number of tardy jobs
- tabu search
- identical parallel machines
- lower and upper bounds
- job shop scheduling problem
- travel time
- scheduling algorithm
- special case
- shortest path