Pages that link to "Item:Q1598882"
From MaRDI portal
The following pages link to Ordinal on-line scheduling for maximizing the minimum machine completion time (Q1598882):
Displaying 25 items.
- Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines (Q862993) (← links)
- Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system (Q866072) (← links)
- Maximizing the minimum completion time on parallel machines (Q1029565) (← links)
- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times (Q1609082) (← links)
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
- Semi-on-line problems on two identical machines with combined partial information (Q1870021) (← links)
- \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← links)
- Ordinal algorithms for parallel machine scheduling (Q1919194) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- Preemptive machine covering on parallel machines (Q2583174) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- General max-min fair allocation (Q2695275) (← links)
- (Q2766832) (← links)
- Dividing a territory among several vehicles (Q2815468) (← links)
- SEMI-ONLINE MACHINE COVERING (Q5295439) (← links)
- SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES (Q5315986) (← links)
- Parallel solutions for ordinal scheduling with a small number of machines (Q6176402) (← links)
- Polynomial-time combinatorial algorithm for general max-min fair allocation (Q6182677) (← links)
- Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan (Q6594026) (← links)
