On-line scheduling of unit time jobs with rejection: minimizing the total completion time.
Leah EpsteinJohn NogaGerhard J. WoegingerPublished in: Oper. Res. Lett. (2002)
Keyphrases
- completion times
- release times
- single machine
- scheduling problem
- single machine scheduling problem
- weighted number of tardy jobs
- processing times
- number of tardy jobs
- weighted sum
- job processing times
- absolute deviation
- release dates
- open shop
- flowshop
- identical parallel machines
- unrelated parallel machines
- identical machines
- minimize total
- weighted tardiness
- scheduling jobs
- job scheduling
- parallel machines
- precedence constraints
- setup times
- optimal scheduling
- maximum lateness
- competitive ratio
- sequence dependent setup times
- deteriorating jobs
- branch and bound algorithm
- resource consumption
- np hard
- queue length
- wafer fabrication
- objective function
- batch processing machines
- precedence relations
- production scheduling
- scheduling algorithm
- limited capacity
- job shop
- fixed number
- tabu search
- simulated annealing
- dynamic programming
- special case