Scheduling with an orthogonal resource constraint
DOI10.1007/S00453-013-9829-5zbMATH Open1325.68038OpenAlexW1992810489MaRDI QIDQ2350899FDOQ2350899
Authors: 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
Recommendations
- Scheduling with an orthogonal resource constraint
- A log-linear \((2 +5/6)\)-approximation algorithm for parallel machine scheduling with a single orthogonal resource
- Resource constrained scheduling on multiple machines
- Multiprocessor scheduling with machine allotment and parallelism constraints
- Tight approximations for resource constrained scheduling and bin packing
approximation algorithmsschedulingmakespan minimizationresource constrained project schedulingresource constraint
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Bin packing can be solved within 1+epsilon in linear time
- Algorithms for Scheduling Independent Tasks
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Scheduling subject to resource constraints: Classification and complexity
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Machine scheduling with resource dependent processing times
- Title not available (Why is that?)
Cited In (6)
- Minimizing the makespan on two identical parallel machines with mold constraints
- Joint cache partition and job assignment on multi-core processors
- Improved scheduling with a shared resource
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Scheduling with an orthogonal resource constraint
- A log-linear \((2 +5/6)\)-approximation algorithm for parallel machine scheduling with a single orthogonal resource
This page was built for publication: Scheduling with an orthogonal resource constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350899)
