Machine covering with combined partial information
From MaRDI portal
(Redirected from Publication:972842)
Recommendations
- Optimal semi-online algorithms for machine covering
- SEMI-ONLINE MACHINE COVERING
- Approximation and Online Algorithms
- Optimal semi-online algorithm for machine covering with nonsimultaneous machine available times
- Online, semi-online algorithms for machine covering with non-simultaneous machine available time
Cites work
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Approximation and Online Algorithms
- On-line bin-stretching
- On-line machine covering
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
- Optimal semi-online algorithms for machine covering
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- 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 algorithms for parallel machine scheduling problems
- Semi-online machine covering on two uniform machines with known total size
- Tight bounds for bandwidth allocation on two links
Cited in
(2)
This page was built for publication: Machine covering with combined partial information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972842)