A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size

DOI10.1007/S10255-012-0137-7zbMath1355.90023OpenAlexW2078892831MaRDI QIDQ511074

Sheng-Yi Cai, Qi-Fan Yang

Publication date: 14 February 2017

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-012-0137-7

zbMATH Keywords

schedulinganalysis of algorithmscompetitive ratiosemi-onlinemachine covering

Mathematics Subject Classification ID

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

Cites Work

• Semi-online machine covering on two uniform machines with known total size
• Semi on-line algorithms for the partition problem
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Semi-online scheduling with ``end of sequence information
• Tight bounds for bandwidth allocation on two links
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES

This page was built for publication: A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size