Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
type: Item
instance of: scholarly article
title: Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
zbMATH Open document ID: 1168.90483
author: Dominique De Werra
author: Tamás Kis
author: Wieslaw Kubiak
published in: Journal of Scheduling
publication date: 2009-08-28T00:00:00Z
full work available at URL: http://infoscience.epfl.ch/record/89539
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5599844
zbMATH Keywords: preemptive open shop scheduling
zbMATH Keywords: multiprocessor operations
zbMATH Keywords: polynomial time algorithms
MaRDI profile type: Publication
OpenAlex ID: W1972282966
cites work: A generalized class-teacher model for some timetabling problems
cites work: Q5668821
cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length
cites work: Scheduling multiprocessor tasks on three dedicated processors
cites work: Shop scheduling problems with multiprocessor tasks on dedicated processors
cites work: Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
cites work: An introduction to timetabling
cites work: Complexity of some special types of timetabling problems
cites work: Scheduling multiprocessor tasks -- An overview
cites work: Complexity of Scheduling Parallel Task Systems
cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
cites work: Q4198056
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations
cites work: Preemptive scheduling with dedicated processors: applications of fractional graph coloring
cites work: Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
DOI: 10.1007/S10951-007-0050-8
Recommended article: Q4501555
Recommended article: On the complexity of preemptive openshop scheduling problems
Recommended article: On the complexity of preemptive open-shop scheduling problems
Recommended article: Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
Recommended article: Approximation algorithms for the multiprocessor open shop scheduling problem
Recommended article: Partially concurrent open shop scheduling with integral preemptions
Recommended article: Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
Recommended article: Q4367460
Recommended article: Polynomial time approximation algorithms for proportionate open‐shop scheduling
Recommended article: Multiprocessor scheduling under precedence constraints: polyhedral results
description: scientific article; zbMATH DE number 5599844