Pages that link to "Item:Q1879360"
From MaRDI portal
The following pages link to Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme (Q1879360):
Displaying 14 items.
- Resource loading with time windows (Q319369) (← links)
- Scheduling malleable tasks with precedence constraints (Q414874) (← links)
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Machine scheduling with resource dependent processing times (Q877194) (← links)
- Online malleable job scheduling for \(m\leq 3\) (Q1944031) (← links)
- Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models (Q2089685) (← links)
- Multi-core real-time scheduling for generalized parallel task models (Q2251375) (← 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)
- An approximation algorithm for the general max-min resource sharing problem (Q2492678) (← links)
- Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines (Q3455878) (← links)
- Asymptotically optimal scheduling of random malleable demands in smart grid (Q4634529) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
- Peak demand minimization via sliced strip packing (Q6066765) (← links)
