Semi-online machine covering on two uniform machines with known total size

DOI10.1007/s00607-006-0187-xzbMath1117.90039OpenAlexW1966332532MaRDI QIDQ858190

N. E. Zubov

Publication date: 8 January 2007

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-006-0187-x

zbMATH Keywords

schedulingcompetitive ratiodesign and analysis of algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

Semi-online scheduling: a survey ⋮ A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size ⋮ Machine covering with combined partial information ⋮ Semi-online machine covering for two uniform machines

Cites Work

• Semi-on-line multiprocessor scheduling with given total processing time
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Bin stretching revisited
• Semi-on-line problems on two identical machines with combined partial information
• Tight bounds for bandwidth allocation on two links
• Optimal non-preemptive semi-online scheduling on two related machines
• Semi-online scheduling with decreasing job sizes
• Randomized on-line scheduling on two uniform machines
• On-line bin-stretching

This page was built for publication: Semi-online machine covering on two uniform machines with known total size