Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs.
Rubing ChenRuyan HeJinjiang YuanPublished in: Comput. Ind. Eng. (2022)
Keyphrases
- minimize total
- single machine
- weighted number of tardy jobs
- preemptive scheduling
- scheduling problem
- release dates
- completion times
- processing times
- dynamic programming
- single machine scheduling problem
- setup times
- number of late jobs
- sequence dependent setup times
- total cost
- training data
- flowshop
- np hard
- learning algorithm