Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
From MaRDI portal
Publication:2436669
DOI10.1007/s10878-012-9498-3zbMath1286.90127OpenAlexW2065791450WikidataQ57399745 ScholiaQ57399745MaRDI QIDQ2436669
Felix G. König, Nicole Megow, Elisabeth Günther
Publication date: 25 February 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9498-3
Related Items (7)
A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows ⋮ Resource loading with time windows ⋮ Scheduling under the network of temporo-spatial proximity relationships ⋮ Ship Traffic Optimization for the Kiel Canal ⋮ Handling precedence constraints in scheduling problems by the sequence pair representation ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ Malleable scheduling for flows of jobs and applications to MapReduce
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Project scheduling with irregular costs: complexity, approximability, and algorithms
- Strip packing with precedence constraints and strip packing with release times
- On the complexity of adjacent resource scheduling
- On the complexity of dynamic programming for sequencing problems with precedence constraints
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Two-dimensional packing problems: a survey
- An approximation algorithm for scheduling trees of malleable tasks
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- A decomposition theorem for partially ordered sets
- An approximation algorithm for scheduling malleable tasks under general precedence constraints
- APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
- Complexity of Scheduling Parallel Task Systems
- Bounds for Multiprocessor Scheduling with Resource Constraints
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Higher‐Dimensional Packing with Order Constraints
This page was built for publication: Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
