On-line machine covering

From MaRDI portal
Publication:5906280

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-Y" /><67::AID-JOS6>3.0.CO;2-Y 10.1002/(SICI)1099-1425(199808)1:2<67::AID-JOS6>3.0.CO;2-YzbMath0909.90169OpenAlexW2011643166MaRDI QIDQ5906280

Leah Epstein, Yossi Azar

Publication date: 1 November 1998

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(199808)1:2<67::aid-jos6>3.0.co;2-y




Related Items (24)

Online-bounded analysisFair Packing of Independent SetsComparing the minimum completion times of two longest-first scheduling-heuristicsRobust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and DeparturesOptimal preemptive online algorithms for scheduling with known largest size on two uniform machinesImproved approaches to the exact solution of the machine covering problemOptimal semi-online algorithms for machine coveringOnline optimisation for ambulance routing in disaster response with partial or no information on victim conditionsMachine covering in the random-order modelOnline max-min fair allocationFair allocation of indivisible items with conflict graphsThe hierarchical model for load balancing on two machinesOn-line machine covering on two machines with local migrationOnline scheduling with rejection and reordering: exact algorithms for unit size jobsOnline algorithms with advice for bin packing and scheduling problemsSymmetry exploitation for online machine covering with bounded migrationOnline Bounded AnalysisTight bounds for bandwidth allocation on two linksMachine covering with combined partial informationOptimal semi-online preemptive algorithms for machine covering on two uniform machinesMaximizing the minimum completion time on parallel machinesSemi-online machine covering for two uniform machinesMaximizing the minimum load for selfish agentsSemi-online scheduling jobs with tightly-grouped processing times on three identical machines







This page was built for publication: On-line machine covering