Pages that link to "Item:Q1300219"

The following pages link to Semi on-line scheduling on two identical machines (Q1300219):

Displaying 50 items.

• Semi-online scheduling with bounded job sizes on two uniform machines (Q338376) (← links)
• Semi-online scheduling for jobs with release times (Q385494) (← links)
• Semi-online scheduling problems on a small number of machines (Q398877) (← links)
• Optimal semi-online algorithm for scheduling with rejection on two uniform machines (Q411229) (← links)
• Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212) (← 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)
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times (Q626449) (← 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)
• An optimal semi-online algorithm for 2-machine scheduling with an availability constraint (Q719024) (← links)
• Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← 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)
• Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines (Q862993) (← 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)
• An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
• Machine covering with combined partial information (Q972842) (← links)
• Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) (← links)
• Semi-online scheduling with machine cost. (Q1433957) (← links)
• The optimal on-line parallel machine scheduling (Q1568731) (← 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)
• Preemptive online algorithms for scheduling with machine cost (Q1777224) (← links)
• Semi-on-line problems on two identical machines with combined partial information (Q1870021) (← links)
• A note on on-line scheduling with partial information (Q1886493) (← links)
• Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
• Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998) (← links)
• The online knapsack problem: advice and randomization (Q2437775) (← 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)
• Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES (Q3379505) (← links)
• Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
• Online Order Scheduling Problem with the Same Order Size on Two Identical Machines (Q4978463) (← links)
• Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines (Q5169463) (← 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)
• A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs (Q5456312) (← links)