Approximability of Scheduling with Fixed Jobs.
Mark ScharbrodtAngelika StegerHorst WeisserPublished in: SODA (1999)
Keyphrases
- identical parallel machines
- fixed number
- parallel machines
- identical machines
- scheduling problem
- job scheduling
- release dates
- unrelated parallel machines
- scheduling strategy
- optimal scheduling
- release times
- processing times
- minimize total
- single machine
- precedence constraints
- polynomial time approximation
- scheduling algorithm
- scheduling jobs
- computational grids
- precedence relations
- batch processing
- setup times
- maximum lateness
- deteriorating jobs
- wafer fabrication
- approximation algorithms
- sequence dependent setup times
- single machine scheduling problem
- round robin
- scheduling policies
- weighted tardiness
- list scheduling
- open shop
- batch processing machines
- completion times
- limited capacity
- resource constraints
- flowshop
- grid computing
- flexible manufacturing systems
- error bounds
- production scheduling
- dynamic programming
- resource management
- competitive ratio