scientific article; zbMATH DE number 5842467
From MaRDI portal
Publication:3070899
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- Fully polynomial time approximation schemes for scheduling divisible loads
- Scheduling divisible loads with time and cost constraints
- Divisible load scheduling and Markov chain models
- scientific article; zbMATH DE number 975417
- Scheduling multiple divisible loads in homogeneous star systems
- Scheduling divisible loads in bus networks with arbitrary processor release times
Cited in
(9)- Scheduling divisible loads with time and cost constraints
- Divisible load scheduling and Markov chain models
- A biased random-key genetic algorithm for single-round divisible load scheduling
- Fully polynomial time approximation schemes for scheduling divisible loads
- A combinatorial problem in a multitask information server
- Recursively divisible problems
- Scheduling multiple divisible loads in homogeneous star systems
- Experimental study of scheduling with memory constraints using hybrid methods
- Grid scheduling divisible loads from two sources
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070899)
