Pages that link to "Item:Q867934"

The following pages link to Online and semi-online scheduling of two machines under a grade of service provision (Q867934):

Displaying 46 items.

• On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
• Semi-online scheduling problems on two uniform machines under a grade of service provision (Q388114) (← links)
• Semi-online scheduling with two GoS levels and unit processing time (Q389944) (← links)
• A note on hierarchical scheduling on two uniform machines (Q604878) (← links)
• Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times (Q626449) (← links)
• Online and semi-online hierarchical scheduling for load balancing on uniform machines (Q631770) (← links)
• Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
• Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
• Online parallel machines scheduling with two hierarchies (Q837151) (← links)
• Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
• Semi-online hierarchical load balancing problem with bounded processing times (Q897964) (← links)
• Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
• The hierarchical model for load balancing on two machines (Q927189) (← links)
• Online scheduling on parallel machines with two goS levels (Q941832) (← links)
• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan (Q975438) (← links)
• Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← links)
• Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
• Total completion time minimization scheduling on two hierarchical uniform machines (Q1676324) (← links)
• Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements (Q1680761) (← links)
• Multiprofessor scheduling (Q1686063) (← links)
• Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
• On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
• An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488) (← links)
• Online scheduling on uniform machines with two hierarchies (Q1928505) (← links)
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 (Q1980488) (← links)
• Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
• Semi-online early work maximization problem on two hierarchical machines with partial information of processing time (Q2151369) (← links)
• Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
• Online scheduling with unit processing times and processing set restrictions (Q2326081) (← links)
• Online fractional hierarchical scheduling on uniformly related machines (Q2333135) (← links)
• On-line booking policies and competitive analysis of medical examination in hospital (Q2336398) (← links)
• Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998) (← links)
• Total completion time minimization in online hierarchical scheduling of unit-size jobs (Q2359792) (← links)
• Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• Online scheduling on two parallel identical machines under a grade of service provision (Q2683376) (← links)
• OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION (Q2905313) (← links)
• Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
• Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing (Q4631681) (← links)
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
• Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
• Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
• Optimal algorithm for semi-online scheduling on two machines under GoS levels (Q5963701) (← links)
• Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time (Q6084675) (← links)
• Bin stretching with migration on two hierarchical machines (Q6093406) (← links)