SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES

DOI10.1142/S0217595905000558zbMath1078.90027OpenAlexW2163575977MaRDI QIDQ5315986

Shijie Sun, Run-Zi Luo

Publication date: 12 September 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595905000558

zbMATH Keywords

competitive ratioSchedulingsemi-on-line

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

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

Cites Work

• Unnamed Item
• The exact LPT-bound for maximizing the minimum completion time
• Semi on-line scheduling on two identical machines
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• The optimal on-line parallel machine scheduling
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System