Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
From MaRDI portal
Publication:6556180
Cites work
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- On an on-line scheduling problem for parallel jobs
- Online scheduling of parallel jobs with preemption on two identical machines
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Scheduling multiprocessor tasks -- An overview
- Scheduling on semi-identical processors
- Scheduling parallel jobs to minimize the makespan
- Scheduling uniform machines on-line requires nondecreasing speed ratios
- Scheduling with deadlines and loss functions
- Scheduling with unexpected machine breakdowns
This page was built for publication: Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556180)