A PTAS for a resource scheduling problem with arbitrary number of parallel machines
From MaRDI portal
Publication:1728364
DOI10.1016/j.orl.2017.09.007zbMath1409.90087OpenAlexW2604107648MaRDI QIDQ1728364
Publication date: 22 February 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://eprints.sztaki.hu/9280/
Related Items (4)
Minimizing makespan on a single machine with release dates and inventory constraints ⋮ EPTAS for load balancing problem on parallel machines with a non-renewable resource ⋮ Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints ⋮ EPTAS for load balancing problem on parallel machines with a non-renewable resource
Cites Work
- Unnamed Item
- Approximability of scheduling problems with resource consuming jobs
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- Single machine scheduling problems with financial resource constraints: some complexity results and properties
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
- Approximation algorithms for inventory constrained scheduling on a single machine
- Scheduling subject to nonrenewable-resource constraints
- Polynomial algorithms for single machine scheduling problems with financial constraints
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Basic scheduling problems with raw material constraints
- Scheduling under a Non-renewable Resource Constraint
This page was built for publication: A PTAS for a resource scheduling problem with arbitrary number of parallel machines