Pages that link to "Item:Q1267197"
From MaRDI portal
The following pages link to Semi on-line algorithms for the partition problem (Q1267197):
Displayed 40 items.
- 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)
- Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Online scheduling with rearrangement on two related machines (Q627161) (← links)
- Online scheduling with a buffer on related machines (Q711400) (← links)
- Optimal preemptive semi-online scheduling on two uniform processors (Q834944) (← links)
- Semi on-line scheduling on three processors with known sum of the tasks (Q835557) (← links)
- Linear time algorithms for parallel machine scheduling (Q856829) (← 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 with reassignment (Q935241) (← links)
- List scheduling for jobs with arbitrary release times and similar lengths (Q954249) (← links)
- Machine covering with combined partial information (Q972842) (← links)
- Two semi-online scheduling problems on two uniform machines (Q1006050) (← links)
- Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) (← links)
- Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← links)
- Semi-online scheduling with machine cost. (Q1433957) (← 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)
- Preemptive online algorithms for scheduling with machine cost (Q1777224) (← 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)
- A note on on-line scheduling with partial information (Q1886493) (← links)
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates (Q2459394) (← 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 on two uniform processors (Q2481966) (← links)
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors (Q2508042) (← links)
- Preemptive semi-online algorithms for parallel machine scheduling with known total size (Q2508575) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← links)
- OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES (Q3379505) (← links)
- SEMI-ONLINE MACHINE COVERING (Q5295439) (← 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)
- On-line bin-stretching (Q5958712) (← links)