The following pages link to On-line machine covering (Q5906280):
Displayed 24 items.
- Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- On-line machine covering on two machines with local migration (Q660883) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Optimal semi-online algorithms for machine covering (Q870840) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- Machine covering with combined partial information (Q972842) (← links)
- Maximizing the minimum completion time on parallel machines (Q1029565) (← links)
- Semi-online machine covering for two uniform machines (Q1034625) (← links)
- Maximizing the minimum load for selfish agents (Q1041221) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
- Tight bounds for bandwidth allocation on two links (Q2486751) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- Fair Packing of Independent Sets (Q5041187) (← links)
- Online Bounded Analysis (Q5740182) (← links)
- Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions (Q6047851) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
- Online max-min fair allocation (Q6109544) (← links)