Scheduling with an orthogonal resource constraint

DOI10.1007/s00453-013-9829-5zbMath1325.68038OpenAlexW1992810489MaRDI QIDQ2350899

Martin Niemeier, Andreas Wiese

Publication date: 25 June 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/181146/files/niemeier-wiese-2012-scheduling-with-orthogonal-constraint.pdf

zbMATH Keywords

schedulingmakespan minimizationapproximation algorithmsresource constraintresource constrained project scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items

Minimizing the makespan on two identical parallel machines with mold constraints, Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times

Cites Work

• Unnamed Item
• Unnamed Item
• Machine scheduling with resource dependent processing times
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Scheduling subject to resource constraints: Classification and complexity
• Bin packing can be solved within 1+epsilon in linear time
• Algorithms for Scheduling Independent Tasks
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies