On contiguous and non-contiguous parallel task scheduling
From MaRDI portal
(Redirected from Publication:892906)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A \((5/3+\varepsilon)\)-approximation for strip packing
- A near-optimal solution to a two-dimensional cutting stock problem
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Bicriteria scheduling for contiguous and non contiguous parallel tasks
- Concurrent Task Systems
- Multiprocessor scheduling with communication delays
- Multiprogram scheduling
- On contiguous and non-contiguous parallel task scheduling
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Scheduling for parallel processing
- Scheduling independent multiprocessor tasks
- The berth planning problem
Cited in
(9)- Peak demand minimization via sliced strip packing
- Quay partitioning problem
- On contiguous and non-contiguous parallel task scheduling
- scientific article; zbMATH DE number 1003247 (Why is no real title available?)
- Selecting algorithms for large berth allocation problems
- Ship traffic optimization for the Kiel Canal
- Bicriteria scheduling for contiguous and non contiguous parallel tasks
- Recent Advances in Constraints
- Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation
This page was built for publication: On contiguous and non-contiguous parallel task scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892906)