Scheduling problems for parallel dedicated machines under multiple resource constraints.

DOI10.1016/S0166-218X(03)00433-5zbMath1053.90039MaRDI QIDQ1417559

Vitaly A. Strusevich, Hans Kellerer

Publication date: 5 January 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Complexity; Scheduling; Approximation; Resource constraints; Parallel dedicated machines

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

Scheduling parallel dedicated machines with the speeding‐up resource, Resource leveling in a machine environment, A job-shop problem with one additional resource type, Scheduling with flexible resources in parallel workcenters to minimize maximum completion time, Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs, Machine scheduling with resource dependent processing times, Scheduling jobs with time-resource tradeoff via nonlinear programming, Scheduling incompatible tasks on two machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling subject to resource constraints: Classification and complexity
• Makespan minimization in open shops: A polynomial time approximation scheme
• Scheduling parallel dedicated machines under a single non-shared resource
• Two machine open shop scheduling problem with setup, processing and removal times separated
• Open Shop Scheduling to Minimize Finish Time
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Approximation Algorithms for Three-Machine Open Shop Scheduling
• Improved Approximation Algorithms for Shop Scheduling Problems
• Two-Machine Open Shops with Renewable Resources
• Short Shop Schedules