Pages that link to "Item:Q1919194"
From MaRDI portal
The following pages link to Ordinal algorithms for parallel machine scheduling (Q1919194):
Displaying 26 items.
- Semi-online scheduling for jobs with release times (Q385494) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Optimal preemptive semi-online scheduling on two uniform processors (Q834944) (← links)
- Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system (Q866072) (← links)
- List scheduling for jobs with arbitrary release times and similar lengths (Q954249) (← links)
- Semi on-line algorithms for the partition problem (Q1267197) (← links)
- Semi-online scheduling with machine cost. (Q1433957) (← links)
- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times (Q1609082) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← 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)
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates (Q2459394) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors (Q2508042) (← links)
- Bin packing using semi-ordinal data (Q2564622) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines (Q5169463) (← links)
- List Scheduling in Order of α-Points on a Single Machine (Q5450810) (← links)
- Semi-online scheduling with decreasing job sizes (Q5929138) (← links)
- Semi-on-line scheduling problems for maximizing the minimum machine completion time (Q5931905) (← links)
- Semi-on-line scheduling with ordinal data on two uniform machines (Q5945393) (← links)
- Parallel solutions for ordinal scheduling with a small number of machines (Q6176402) (← links)
- Online cardinality constrained scheduling (Q6556169) (← links)