SEMI-ONLINE MACHINE COVERING

DOI10.1142/S0217595907001255zbMath1141.90462OpenAlexW2116943994MaRDI QIDQ5295439

Sheng-Yi Cai

Publication date: 30 July 2007

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

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

zbMATH Keywords

schedulingcompetitive ratioanalysis of algorithmsemi-onlinemachine covering

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (1)

Improved approaches to the exact solution of the machine covering problem

Cites Work

• A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
• The exact LPT-bound for maximizing the minimum completion time
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Semi-online scheduling with decreasing job sizes
• Semi-on-line scheduling with ordinal data on two uniform machines

This page was built for publication: SEMI-ONLINE MACHINE COVERING