Pages that link to "Item:Q5716131"
From MaRDI portal
The following pages link to PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES (Q5716131):
Displaying 12 items.
- Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness (Q499334) (← links)
- Extra processors versus future information in optimal deadline scheduling (Q706313) (← links)
- Preemptive multiprocessor task scheduling with release times and time windows (Q1374419) (← links)
- An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585) (← links)
- Preemptive scheduling with variable profile, precedence constraints and due dates (Q1805445) (← links)
- Preemptive scheduling on identical parallel machines subject to deadlines. (Q1810503) (← links)
- The worst-case analysis of the Garey-Johnson algorithm (Q2268512) (← links)
- (Q3220334) (← links)
- (Q3680271) (← links)
- (Q3793928) (← links)
- An experimental investigation of scheduling non-identical, parallel processors with sequence-dependent set-up times and due dates (Q4398895) (← links)
- Scheduling with precedence constraints: Worst-case analysis of priority algorithms (Q4709806) (← links)