Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost.
Ran MaJinjiang YuanPublished in: Inf. Process. Lett. (2013)
Keyphrases
- single machine
- job processing times
- release times
- scheduling problem
- release dates
- minimize total
- processing times
- maximum lateness
- scheduling jobs
- weighted tardiness
- earliness tardiness
- sequence dependent setup times
- total tardiness
- completion times
- single machine scheduling problem
- total weighted tardiness
- makespan minimization
- flowshop
- number of late jobs
- identical machines
- parallel machines
- deteriorating jobs
- production scheduling
- total cost
- learning effect
- precedence constraints
- rolling horizon
- weighted number of tardy jobs
- online learning
- competitive ratio
- setup times
- job shop scheduling
- dynamic programming
- lower bound
- genetic algorithm