An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
From MaRDI portal
Publication:935202
DOI10.1016/j.orl.2007.08.001zbMath1163.90494OpenAlexW2004033524MaRDI QIDQ935202
Publication date: 6 August 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.08.001
Related Items
Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ Algorithms for the unrelated parallel machine scheduling problem with a resource constraint ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Scheduling on two identical machines with a speed-up resource ⋮ Approximation algorithms for scheduling on multi-core processor with shared speedup resources ⋮ Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources ⋮ Parallel machine scheduling with speed-up resources ⋮ Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times ⋮ Scheduling jobs with time-resource tradeoff via nonlinear programming ⋮ Production, maintenance and resource scheduling: a review ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods
Uses Software
Cites Work
