Pages that link to "Item:Q4025916"
From MaRDI portal
The following pages link to Optimal Preemptive Scheduling of Two Unrelated Processors (Q4025916):
Displaying 13 items.
- A two-stage hardware scheduler combining greedy and optimal scheduling (Q436901) (← links)
- Extra processors versus future information in optimal deadline scheduling (Q706313) (← links)
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling (Q1033671) (← links)
- On the two-phase method for preemptive scheduling (Q1107434) (← links)
- Scheduling unit-time jobs on processors with different capabilities (Q1121780) (← links)
- Preemptive on-line scheduling for two uniform processors (Q1306385) (← links)
- Ideal preemptive schedules on two processors (Q1424363) (← links)
- Little-preemptive scheduling on unrelated processors (Q1868263) (← links)
- On preemptive scheduling: A general setting for the two-phase method (Q1917267) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER (Q3444847) (← links)
- Tighter bounds on preemptive job shop scheduling with two machines (Q5947304) (← links)
- On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912) (← links)