Pages that link to "Item:Q5929138"
From MaRDI portal
The following pages link to Semi-online scheduling with decreasing job sizes (Q5929138):
Displaying 43 items.
- Semi-online scheduling for jobs with release times (Q385494) (← links)
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Online bin stretching with bunch techniques (Q497684) (← links)
- Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- Semi-online scheduling with known partial information about job sizes on two identical machines (Q551204) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Online scheduling with a buffer on related machines (Q711400) (← links)
- Several semi-online scheduling problems on two identical machines with combined information (Q714838) (← links)
- Optimal preemptive semi-online scheduling on two uniform processors (Q834944) (← links)
- Linear time algorithms for parallel machine scheduling (Q856829) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Semi-online machine covering on two uniform machines with known total size (Q858190) (← links)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← links)
- Optimal semi-online algorithms for machine covering (Q870840) (← links)
- Semi-online scheduling problems on two identical machines with inexact partial information (Q884466) (← links)
- Online scheduling of unit jobs on three machines with rejection: a tight result (Q903197) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Online scheduling with reassignment (Q935241) (← links)
- List scheduling for jobs with arbitrary release times and similar lengths (Q954249) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Semi-online machine covering for two uniform machines (Q1034625) (← 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)
- Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- Semi-on-line problems on two identical machines with combined partial information (Q1870021) (← links)
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Semi-online scheduling with ``end of sequence'' information (Q2460107) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← 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)
- ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← links)
- Online Order Scheduling Problem with the Same Order Size on Two Identical Machines (Q4978463) (← links)
- SEMI-ONLINE MACHINE COVERING (Q5295439) (← links)
- Semi-on-line scheduling with ordinal data on two uniform machines (Q5945393) (← links)
- Semi-online scheduling with combined information on two identical machines in parallel (Q5963644) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Parallel solutions for ordinal scheduling with a small number of machines (Q6176402) (← links)
