On contiguous and non-contiguous parallel task scheduling
type: Item
instance of: scholarly article
title: On contiguous and non-contiguous parallel task scheduling
zbMATH Open document ID: 1328.90045
author: Iwo Błądek
author: Frédéric Guinand
author: Xavier Schepler
author: M. Drozdowski
published in: Journal of Scheduling
publication date: 2015-11-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6508016
zbMATH Keywords: parallel tasks
zbMATH Keywords: contiguous scheduling
zbMATH Keywords: non-contiguous scheduling
Wikidata QID: Q59403417
MaRDI profile type: Publication
full work available at URL: s10951-015-0427-z
OpenAlex ID: W2002506580
cites work: Scheduling independent multiprocessor tasks
cites work: Bicriteria scheduling for contiguous and non contiguous parallel tasks
cites work: A survey of berth allocation and quay crane scheduling problems in container terminals
cites work: The berth planning problem
cites work: Multiprogram scheduling
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Scheduling for parallel processing
cites work: Q4198056
cites work: A \((5/3+\varepsilon)\)-approximation for strip packing
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: Concurrent Task Systems
cites work: A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2
cites work: Multiprocessor scheduling with communication delays
DOI: 10.1007/S10951-015-0427-Z
description: scientific article; zbMATH DE number 6508016