Machine covering with combined partial information
DOI10.1016/J.JSPI.2010.01.030zbMATH Open1186.90057OpenAlexW2039434112MaRDI QIDQ972842FDOQ972842
Authors: Yong Wu, Yikun Huang, Qifan Yang 
Publication date: 21 May 2010
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2010.01.030
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
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Semi-on-line multiprocessor scheduling with given total processing time
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- On-line machine covering
- Semi on-line scheduling on two identical machines
- Semi on-line algorithms for the partition problem
- Semi-on-line problems on two identical machines with combined partial information
- Semi-online algorithms for parallel machine scheduling problems
- Approximation and Online Algorithms
- On-line bin-stretching
- Optimal semi-online algorithms for machine covering
- Tight bounds for bandwidth allocation on two links
- Semi-online machine covering on two uniform machines with known total size
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
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)
