Reductions between scheduling problems with non-renewable resources and knapsack problems
From MaRDI portal
Publication:482287
DOI10.1016/J.TCS.2014.11.007zbMATH Open1315.90015OpenAlexW1976110695MaRDI QIDQ482287FDOQ482287
Authors: Péter Györgyi, Tamás Kis 
Publication date: 22 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.007
Recommendations
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Approximability of scheduling problems with resource consuming jobs
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Job Shop Scheduling under a Non-Renewable Resource Constraint
- Non-approximability results for scheduling problems with minsum criteria
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- 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
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Coordinated scheduling of production and delivery with production window and delivery capacity constraints
- 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
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Single-machine scheduling under the job rejection constraint
- Approximation algorithms for knapsack problems with cardinality constraints
- Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity
- The stock size problem
- Title not available (Why is that?)
- Approximate solution of NP optimization problems
- Completeness in approximation classes
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
- A new fully polynomial time approximation scheme for the Knapsack problem
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Title not available (Why is that?)
- Partially ordered knapsack and applications to scheduling
Cited In (10)
- 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
- Scheduling with non-renewable resources: minimizing the sum of completion times
- An FPTAS of minimizing total weighted completion time on single machine with position constraint
- 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
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Approximability of total weighted completion time with resource consuming jobs
Uses Software
This page was built for publication: Reductions between scheduling problems with non-renewable resources and knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482287)
