On-line scheduling of parallel jobs with runtime restrictions.
Stefan BischofErnst W. MayrPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- identical machines
- parallel machines
- batch processing machines
- processing times
- scheduling problem
- single machine
- job scheduling
- maximum lateness
- precedence constraints
- minimize total
- unrelated parallel machines
- release dates
- identical parallel machines
- shared memory
- sequence dependent setup times
- scheduling jobs
- massively parallel
- precedence relations
- single machine scheduling problem
- weighted tardiness
- computational grids
- setup times
- batch processing
- optimal scheduling
- flowshop
- fixed number
- polynomial time approximation
- deteriorating jobs
- scheduling strategy
- resource constraints
- release times
- parallel computing
- list scheduling
- multiprocessor systems
- parallel processors
- resource consumption
- branch and bound algorithm
- parallel implementation
- parallel processing