On-line machine covering
From MaRDI portal
Publication:5906280
DOI<67::AID-JOS6>3.0.CO;2-Y 10.1002/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-YzbMath0909.90169MaRDI QIDQ5906280
Publication date: 1 November 1998
Published in: Journal of Scheduling (Search for Journal in Brave)
competitive ratio; randomized algorithm; load; parallel identical machines; machine covering; on-line
90B35: Deterministic scheduling theory in operations research
Related Items
Online Bounded Analysis, Comparing the minimum completion times of two longest-first scheduling-heuristics, Online scheduling with rejection and reordering: exact algorithms for unit size jobs, Online algorithms with advice for bin packing and scheduling problems, Optimal semi-online preemptive algorithms for machine covering on two uniform machines, On-line machine covering on two machines with local migration, Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines, Optimal semi-online algorithms for machine covering, The hierarchical model for load balancing on two machines, Machine covering with combined partial information, Maximizing the minimum completion time on parallel machines, Semi-online machine covering for two uniform machines, Maximizing the minimum load for selfish agents, Online-bounded analysis, Improved approaches to the exact solution of the machine covering problem, Tight bounds for bandwidth allocation on two links, Semi-online scheduling jobs with tightly-grouped processing times on three identical machines, Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
