An online scheduling of two type parallel jobs on identical machines
From MaRDI portal
Publication:3170006
Recommendations
- Online scheduling of parallel jobs with preemption on two identical machines
- On an on-line scheduling problem for parallel jobs
- Parallel solutions for preemptive makespan scheduling on two identical machines
- On-line scheduling of parallel jobs on two machines
- An optimal algorithm for preemptive on-line scheduling
Cites work
- On an on-line scheduling problem for parallel jobs
- On the complexity of multiprocessor task scheduling
- On-line scheduling of parallel jobs in a list
- On-line scheduling of parallel jobs on two machines
- Online scheduling of parallel jobs on two machines is 2-competitive
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Scheduling Parallel Machines On-Line
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- Scheduling on identical machines: How good is LPT in an on-line setting?
- Scheduling parallel jobs to minimize the makespan
Cited in
(7)- Parallel solutions for preemptive makespan scheduling on two identical machines
- Online scheduling of parallel jobs with preemption on two identical machines
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
- Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
- Online MapReduce processing on two identical parallel machines
This page was built for publication: An online scheduling of two type parallel jobs on identical machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170006)
