Single machine scheduling problems with financial resource constraints: some complexity results and properties
DOI10.1016/J.MATHSOCSCI.2011.04.004zbMATH Open1229.90059OpenAlexW2108940302WikidataQ57633864 ScholiaQ57633864MaRDI QIDQ554491FDOQ554491
Authors: Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner 
Publication date: 4 August 2011
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2011.04.004
Recommendations
- scientific article; zbMATH DE number 4072697
- Polynomial algorithms for single machine scheduling problems with financial constraints
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
- scientific article; zbMATH DE number 3976751
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Title not available (Why is that?)
- Scheduling subject to nonrenewable-resource constraints
- Scheduling under a Non-renewable Resource Constraint
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
- Minimizing Total Tardiness on One Machine is NP-Hard
- Title not available (Why is that?)
- Title not available (Why is that?)
- A decomposition algorithm for the single machine total tardiness problem
- Solution of the single machine total tardiness problem
- A special case of the single-machine total tardiness problem is NP-hard
- Title not available (Why is that?)
- Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
Cited In (17)
- Approximability of scheduling problems with resource consuming jobs
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
- Approximation schemes for single machine scheduling with non-renewable resource constraints
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- Scheduling with non-renewable resources: minimizing the sum of completion times
- Polynomial algorithms for single machine scheduling problems with financial constraints
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
- A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs
- On single machine scheduling with resource constraint
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
- A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
- Interweaving real-time jobs with energy harvesting to maximize throughput
- Complexity of some project scheduling problem with nonrenewable resources
- Approximation schemes for parallel machine scheduling with non-renewable resources
- Approximability of total weighted completion time with resource consuming jobs
- Minimizing makespan on a single machine with release dates and inventory constraints
- Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint
This page was built for publication: Single machine scheduling problems with financial resource constraints: some complexity results and properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554491)
