Pages that link to "Item:Q1019187"

The following pages link to Online scheduling on two uniform machines to minimize the makespan (Q1019187):

Displaying 19 items.

• Semi-online scheduling with two GoS levels and unit processing time (Q389944) (← links)
• Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
• Online scheduling with rearrangement on two related machines (Q627161) (← links)
• Online scheduling with rejection and withdrawal (Q650898) (← links)
• Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
• Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
• Online scheduling with reassignment on two uniform machines (Q982662) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• General parametric scheme for the online uniform machine scheduling problem with two different speeds (Q1707972) (← links)
• Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462) (← links)
• Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines (Q1944914) (← links)
• Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
• Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• Online scheduling on two parallel identical machines under a grade of service provision (Q2683376) (← links)
• ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER (Q2929632) (← links)
• Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
• Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
• Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)