Pages that link to "Item:Q1396837"
From MaRDI portal
The following pages link to Computing optimal preemptive schedules for parallel tasks: linear programming approaches (Q1396837):
Displaying 13 items.
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
- An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines (Q596461) (← links)
- Linear programming based algorithms for preemptive and non-preemptive RCPSP (Q884023) (← links)
- Scheduling preemptable tasks on parallel processors with limited availability (Q1575603) (← links)
- Optimal scheduling of progressive processing tasks (Q1594849) (← links)
- Research on the parallel-batch scheduling with linearly lookahead model (Q2666738) (← links)
- Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time (Q3758549) (← links)
- Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors (Q4376737) (← links)
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES (Q5716131) (← links)
- Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness (Q5961604) (← links)
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times (Q6547139) (← links)
