Pages that link to "Item:Q2093189"
From MaRDI portal
The following pages link to Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189):
Displaying 14 items.
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
- On the two-phase method for preemptive scheduling (Q1107434) (← links)
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299) (← links)
- How useful are preemptive schedules? (Q1413904) (← links)
- Preemptive scheduling on identical parallel machines subject to deadlines. (Q1810503) (← links)
- Little-preemptive scheduling on unrelated processors (Q1868263) (← links)
- Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808) (← links)
- Schedules with a single preemption on uniform parallel machines (Q2414478) (← links)
- Optimal Preemptive Scheduling of Two Unrelated Processors (Q4025916) (← links)
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations (Q4319223) (← links)
- Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines (Q4685818) (← links)
- The power of preemption on unrelated machines and applications to scheduling orders (Q5891554) (← links)
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders (Q5902163) (← links)
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines (Q5945391) (← links)
