Pages that link to "Item:Q1427805"
From MaRDI portal
The following pages link to On-line algorithms for the channel assignment problem in cellular networks. (Q1427805):
Displaying 20 items.
- Genetic tabu search for robust fixed channel assignment under dynamic traffic data (Q409273) (← links)
- A note on hierarchical scheduling on two uniform machines (Q604878) (← links)
- Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
- Online and semi-online hierarchical scheduling for load balancing on uniform machines (Q631770) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- Online scheduling on parallel machines with two goS levels (Q941832) (← links)
- Total completion time minimization scheduling on two hierarchical uniform machines (Q1676324) (← links)
- Online scheduling on uniform machines with two hierarchies (Q1928505) (← links)
- Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998) (← links)
- Total completion time minimization in online hierarchical scheduling of unit-size jobs (Q2359792) (← links)
- The dynamic frequency assignment problem (Q2378376) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION (Q2905313) (← links)
- Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)