Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs.
Danny HermelinMatthias MnichSimon OmlorPublished in: CoRR (2019)
Keyphrases
- weighted number of tardy jobs
- single machine
- minimize total
- scheduling problem
- completion times
- processing times
- maximum lateness
- total weighted tardiness
- earliness tardiness
- total tardiness
- release dates
- weighted tardiness
- job processing times
- release times
- scheduling jobs
- dynamic programming
- sequence dependent setup times
- competitive ratio
- number of late jobs
- learning effect
- production scheduling
- single machine scheduling problem
- upper bound
- tardiness cost
- setup times
- rolling horizon
- evolutionary algorithm
- lower bound
- objective function