On contiguous and non-contiguous parallel task scheduling

DOI10.1007/s10951-015-0427-zzbMath1328.90045OpenAlexW2002506580WikidataQ59403417 ScholiaQ59403417MaRDI QIDQ892906

Frédéric Guinand, Iwo Błądek, Xavier Schepler, Maciej Drozdowski

Publication date: 12 November 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-015-0427-z

zbMATH Keywords

parallel taskscontiguous schedulingnon-contiguous scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Peak demand minimization via sliced strip packing ⋮ On contiguous and non-contiguous parallel task scheduling ⋮ Quay partitioning problem ⋮ Ship Traffic Optimization for the Kiel Canal ⋮ Selecting algorithms for large berth allocation problems

Cites Work

• Unnamed Item
• A \((5/3+\varepsilon)\)-approximation for strip packing
• On contiguous and non-contiguous parallel task scheduling
• Multiprocessor scheduling with communication delays
• Bicriteria scheduling for contiguous and non contiguous parallel tasks
• Scheduling for parallel processing
• 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
• The berth planning problem
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Multiprogram scheduling
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Concurrent Task Systems
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• Scheduling independent multiprocessor tasks

This page was built for publication: On contiguous and non-contiguous parallel task scheduling