Pages that link to "Item:Q5386206"
From MaRDI portal
The following pages link to A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks (Q5386206):
Displaying 20 items.
- Resource loading with time windows (Q319369) (← links)
- Scheduling malleable tasks with precedence constraints (Q414874) (← links)
- Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks (Q433430) (← links)
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework (Q666034) (← links)
- Machine scheduling with resource dependent processing times (Q877194) (← links)
- Bicriteria scheduling for contiguous and non contiguous parallel tasks (Q940878) (← links)
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time (Q1762110) (← links)
- Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models (Q2089685) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds (Q2164700) (← links)
- Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space (Q2197157) (← links)
- Online scheduling of moldable parallel tasks (Q2317140) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- Competitive online scheduling of perfectly malleable jobs with setup times (Q2467259) (← links)
- Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
- (Q5875469) (← links)
- Malleable scheduling beyond identical machines (Q6090217) (← links)
- An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)
- Efficient approximation algorithms for scheduling moldable tasks (Q6113310) (← links)
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (Q6136082) (← links)
