An Approximation Scheme for Scheduling Independent Jobs into Subcubes of a Hypercube of Fixed Dimension.
Y. KopidakisVassilis ZissimopoulosPublished in: Theor. Comput. Sci. (1997)
Keyphrases
- polynomial time approximation
- identical machines
- identical parallel machines
- job scheduling
- fixed number
- scheduling strategy
- approximation algorithms
- processing times
- scheduling problem
- parallel machines
- precedence constraints
- data cube
- scheduling jobs
- minimize total
- release dates
- approximation error
- np hard
- error bounds
- approximation schemes
- precedence relations
- computational grids
- weighted tardiness
- flowshop
- scheduling algorithm
- single machine
- database
- randomized approximation
- deteriorating jobs
- unrelated parallel machines
- optimal scheduling
- release times
- parallel algorithm
- sequence dependent setup times
- batch processing
- single server
- wafer fabrication
- single machine scheduling problem
- scheduling policies