Semi-online machine covering on two uniform machines with known total size
From MaRDI portal
(Redirected from Publication:858190)
Recommendations
- Semi-online scheduling with known maximum job size on two uniform machines
- Two semi-online scheduling problems on two uniform machines
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
- Semi-online scheduling on two uniform machines with the known largest size
- SEMI-ONLINE MACHINE COVERING
Cites work
- Bin stretching revisited
- On-line bin-stretching
- Optimal non-preemptive semi-online scheduling on two related machines
- Randomized on-line scheduling on two uniform machines
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- Semi-on-line multiprocessor scheduling with given total processing time
- Semi-on-line problems on two identical machines with combined partial information
- Semi-online scheduling with decreasing job sizes
- Tight bounds for bandwidth allocation on two links
Cited in
(8)- Semi-online machine covering for two uniform machines
- Semi-online scheduling: a survey
- Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs
- A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size
- SEMI-ONLINE MACHINE COVERING
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- Approximation and Online Algorithms
- Machine covering with combined partial information
This page was built for publication: Semi-online machine covering on two uniform machines with known total size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858190)
