Single machine scheduling problems with financial resource constraints: some complexity results and properties

DOI10.1016/J.MATHSOCSCI.2011.04.004MaRDI QIDQ554491zbMATHOpenAlexWikidataFDO

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

zbMATH Keywords

complexityschedulingnon-renewable resource

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

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

Cites work

• scientific article; zbMATH DE number 3976751 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A decomposition algorithm for the single machine total tardiness problem
• A special case of the single-machine total tardiness problem is NP-hard
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Scheduling subject to nonrenewable-resource constraints
• Scheduling under a Non-renewable Resource Constraint
• Solution of the single machine total tardiness problem

Cited in

(18)

• A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
• Approximation schemes for parallel machine scheduling with non-renewable resources
• Interweaving real-time jobs with energy harvesting to maximize throughput
• Scheduling with non-renewable resources: minimizing the sum of completion times
• Minimizing makespan on a single machine with release dates and inventory constraints
• Reductions between scheduling problems with non-renewable resources and knapsack problems
• Single-machine scheduling with an external resource
• A PTAS for a resource scheduling problem with arbitrary number of parallel machines
• Complexity of some project scheduling problem with nonrenewable resources
• Polynomial algorithms for single machine scheduling problems with financial constraints
• Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint
• Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
• Approximability of scheduling problems with resource consuming jobs
• Approximation schemes for single machine scheduling with non-renewable resource constraints
• On single machine scheduling with resource constraint
• 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
• Approximability of total weighted completion time with resource consuming jobs

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)