Pages that link to "Item:Q2508148"

The following pages link to Optimal online algorithms for scheduling on two identical machines under a grade of service (Q2508148):

Displayed 13 items.

• 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)
• Online parallel machines scheduling with two hierarchies (Q837151) ‎ (← 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)
• Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) ‎ (← links)
• OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION (Q2905313) ‎ (← links)
• Makespan minimization in online scheduling with machine eligibility (Q5894207) ‎ (← links)