Single-machine online scheduling of jobs with non-delayed processing constraint.
Wenjie LiJinjiang YuanPublished in: J. Comb. Optim. (2021)
Keyphrases
- single machine
- release times
- scheduling problem
- minimize total
- release dates
- scheduling jobs
- identical machines
- processing times
- maximum lateness
- weighted tardiness
- sequence dependent setup times
- total tardiness
- earliness tardiness
- total weighted tardiness
- number of tardy jobs
- deteriorating jobs
- identical parallel machines
- parallel machines
- batch processing
- setup times
- job processing times
- single machine scheduling problem
- precedence constraints
- number of late jobs
- flowshop
- dominance rules
- completion times
- weighted number of tardy jobs
- online learning
- shortest processing time
- dynamic programming
- makespan minimization
- production scheduling
- learning effect
- rolling horizon
- competitive ratio
- fixed number
- global constraints
- total cost
- benchmark problems
- branch and bound algorithm
- dispatching rule
- np hard