scientific article; zbMATH DE number 5842467
From MaRDI portal
Publication:3070899
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) 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)- A biased random-key genetic algorithm for single-round divisible load scheduling
- Scheduling multiple divisible loads in homogeneous star systems
- Grid scheduling divisible loads from two sources
- Experimental study of scheduling with memory constraints using hybrid methods
- Divisible load scheduling and Markov chain models
- Recursively divisible problems
- Fully polynomial time approximation schemes for scheduling divisible loads
- Scheduling divisible loads with time and cost constraints
- A combinatorial problem in a multitask information server
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)
