Scheduling with non-renewable resources: minimizing the sum of completion times
From MaRDI portal
Publication:6547136
DOI10.1007/S10951-024-00807-YzbMATH Open1542.90088MaRDI QIDQ6547136FDOQ6547136
Kristóf Bérczi, Tamás Király, Simon Omlor
Publication date: 30 May 2024
Published in: Journal of Scheduling (Search for Journal in Brave)
approximation algorithmnon-renewable resourcesschedulingpolynomial-time approximation schemestrong NP-hardnessweighted sum of completion times
Cites Work
- Title not available (Why is that?)
- Scheduling subject to nonrenewable-resource constraints
- Approximability of scheduling problems with resource consuming jobs
- Basic scheduling problems with raw material constraints
- Scheduling under a Non-renewable Resource Constraint
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- 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
- Polynomial algorithms for single machine scheduling problems with financial constraints
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Approximability of total weighted completion time with resource consuming jobs
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
This page was built for publication: Scheduling with non-renewable resources: minimizing the sum of completion times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547136)
