Approximation schemes for single machine scheduling with non-renewable resource constraints
From MaRDI portal
Publication:398908
DOI10.1007/S10951-013-0346-9zbMATH Open1297.90045OpenAlexW2170793368MaRDI QIDQ398908FDOQ398908
Authors: Péter Györgyi, Tamás Kis 
Publication date: 18 August 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/26101/1/mat_v1.pdf
Recommendations
- Approximation schemes for parallel machine scheduling with non-renewable resources
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
- Scheduling with non-renewable resources: minimizing the sum of completion times
- Scheduling under a Non-renewable Resource Constraint
Cites Work
- Title not available (Why is that?)
- Scheduling subject to nonrenewable-resource constraints
- Project scheduling with inventory constraints
- Basic scheduling problems with raw material constraints
- Scheduling under a Non-renewable Resource Constraint
- Exact algorithms for inventory constrained scheduling on a single machine
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- 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
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- Scheduling subject to resource constraints: Classification and complexity
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
Cited In (20)
- Approximability of scheduling problems with resource consuming jobs
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
- A multivariate complexity analysis of the material consumption scheduling problem
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- Scheduling with non-renewable resources: minimizing the sum of completion times
- Approximation algorithms for inventory constrained scheduling on a single machine
- A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion
- Application of the interpolation approach for approximating single-machine scheduling problem with an unknown objective function
- An FPTAS of minimizing total weighted completion time on single machine with position constraint
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- Interweaving real-time jobs with energy harvesting to maximize throughput
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
- Approximability of total weighted completion time with resource consuming jobs
- Minimizing makespan on a single machine with release dates and inventory constraints
- Title not available (Why is that?)
This page was built for publication: Approximation schemes for single machine scheduling with non-renewable resource constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398908)
