Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs.
Yuan GaoJinjiang YuanPublished in: J. Comb. Optim. (2019)
Keyphrases
- minimize total
- single machine
- weighted number of tardy jobs
- scheduling problem
- release dates
- parallel machines
- processing times
- dynamic programming
- optimal assignment
- total cost
- parallel computing
- single machine scheduling problem
- shared memory
- precedence constraints
- integer programming
- text categorization
- training set