Scheduling Preemptable Jobs on Identical Processors Under Varying Availability of an Additional Continuous Resource.
Rafal RózyckiGrzegorz WaligóraJan WeglarzPublished in: Int. J. Appl. Math. Comput. Sci. (2016)
Keyphrases
- job scheduling
- processing times
- grid environment
- resource allocation
- scheduling problem
- identical machines
- communication delays
- parallel machines
- list scheduling
- identical parallel machines
- resource consumption
- release dates
- scheduling algorithm
- single machine
- precedence relations
- resource constraints
- scheduling jobs
- scheduling strategy
- minimize total
- release times
- multiprocessor systems
- setup times
- resource availability
- unrelated parallel machines
- parallel processors
- precedence constraints
- parallel processing
- parallel algorithm
- computational grids
- single machine scheduling problem
- grid computing
- flowshop
- fixed number
- weighted tardiness
- data access
- batch processing
- optimal scheduling
- deteriorating jobs
- distributed memory
- shared memory
- load balancing
- wafer fabrication
- scarce resources
- dynamic programming