Scheduling parallel dedicated machines under a single non-shared resource
type: Item
instance of: scholarly article
title: Scheduling parallel dedicated machines under a single non-shared resource
zbMATH Open document ID: 1037.90030
DOI: 10.1016/S0377-2217(02)00246-1
author: Hans Kellerer
author: V. A. Strusevich
published in: European Journal of Operational Research
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1902812
zbMATH Keywords: Parallel dedicated machines
zbMATH Keywords: non-shared resources
zbMATH Keywords: complexity
zbMATH Keywords: approximation
zbMATH Keywords: worst-case analysis
MaRDI profile type: Publication
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Q4326789
cites work: Q4198056
cites work: Scheduling for parallel dedicated machines with a single server
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Parallel machine scheduling with a common server
cites work: Q3995531
cites work: Scheduling with batching: A review
cites work: Makespan minimization in open shops: A polynomial time approximation scheme
cites work: An open shop scheduling problem with a non-bottleneck machine
description: scientific article; zbMATH DE number 1902812