Minimizing the maximum starting time on-line
From MaRDI portal
(Redirected from Publication:1763375)
Recommendations
- scientific article; zbMATH DE number 1947413
- Online minimization of the maximum starting time: migration helps
- Online single machine scheduling to minimize the maximum starting time
- Minimizing the total completion time on-line on a single machine, using restarts
- scientific article; zbMATH DE number 1947447
- Online scheduling to minimize maximum response time and maximum delay factor
- scientific article; zbMATH DE number 7051282
- Starting time minimization for the maximum job variant
- Algorithm Theory - SWAT 2004
- Online makespan minimization: the power of restart
Cites work
- A Better Algorithm for an Ancient Scheduling Problem
- Ancient and new algorithms for load balancing in the \(\ell_p\) norm
- Applying extra-resource analysis to load balancing.
- Better Bounds for Online Scheduling
- Bounds for Certain Multiprocessing Anomalies
- scientific article; zbMATH DE number 1306855 (Why is no real title available?)
- scientific article; zbMATH DE number 1383710 (Why is no real title available?)
- scientific article; zbMATH DE number 1445351 (Why is no real title available?)
- Maximizing job completions online
- New algorithms for an ancient scheduling problem.
- On-line scheduling revisited
- Optimal time-critical scheduling via resource augmentation
- Resource augmentation in load balancing.
- Scheduling in the dark
Cited in
(5)- Starting time minimization for the maximum job variant
- scientific article; zbMATH DE number 1947413 (Why is no real title available?)
- Online single machine scheduling to minimize the maximum starting time
- Online minimization of the maximum starting time: migration helps
- Variants and objectives for ordinal scheduling
This page was built for publication: Minimizing the maximum starting time on-line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763375)