Single machine rescheduling for new orders: properties and complexity results.
Elena RenerFabio SalassaVincent T'kindtPublished in: CoRR (2023)
Keyphrases
- single machine
- scheduling problem
- processing times
- total weighted tardiness
- maximum lateness
- earliness tardiness
- scheduling jobs
- minimize total
- total tardiness
- sequence dependent setup times
- computational complexity
- weighted tardiness
- rolling horizon
- release times
- release dates
- job shop
- setup times
- learning effect
- dynamic programming
- number of late jobs
- production scheduling
- weighted number of tardy jobs
- single machine scheduling problem
- worst case
- competitive ratio
- decision problems
- production system
- flowshop
- genetic algorithm
- parallel machines