Scheduling problems for parallel dedicated machines under multiple resource constraints.
type: Item
instance of: scholarly article
title: Scheduling problems for parallel dedicated machines under multiple resource constraints.
zbMATH Open document ID: 1053.90039
DOI: 10.1016/S0166-218X(03)00433-5
author: Hans Kellerer
author: V. A. Strusevich
published in: Discrete Applied Mathematics
publication date: 2004-01-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2021214
zbMATH Keywords: Scheduling
zbMATH Keywords: Parallel dedicated machines
zbMATH Keywords: Resource constraints
zbMATH Keywords: Complexity
zbMATH Keywords: Approximation
MaRDI profile type: Publication
cites work: Q3496142
cites work: Q3821925
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Approximation Algorithms for Three-Machine Open Shop Scheduling
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: Two-Machine Open Shops with Renewable Resources
cites work: Scheduling parallel dedicated machines under a single non-shared resource
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Q3995531
cites work: Makespan minimization in open shops: A polynomial time approximation scheme
cites work: Improved Approximation Algorithms for Shop Scheduling Problems
cites work: Two machine open shop scheduling problem with setup, processing and removal times separated
cites work: Short Shop Schedules
description: scientific article; zbMATH DE number 2021214