Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
From MaRDI portal
Publication:5749161
Recommendations
- Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
- Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
- Separable convex resource allocation problem with \(L_1\)-distance constraint
- A faster algorithm for the resource allocation problem with convex cost functions
- A Study on r-Configurations---A Resource Assignment Problem on Graphs
- A class of dynamic problems of optimal resource distribution on networks
- Problems with resource allocation constraints and optimization over the efficient set
- The resource dependent assignment problem with a convex agent cost function
- Some problems of optimal allocation of scarce resources on a network graph of interdependent activities
Cited in
(49)- Descent methods for convex essentially smooth minimization
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity
- Optimal workforce assignment to operations of a paced assembly line
- Resource cost aware scheduling
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
- The resource dependent assignment problem with a convex agent cost function
- Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Scheduling a batching machine with convex resource consumption functions
- Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Inverse interval scheduling via reduction on a single machine
- Single-machine scheduling with machine unavailability periods and resource dependent processing times
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- A survey of scheduling with controllable processing times
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- Scheduling with due date assignment under special conditions on job processing
- Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine
- Minimizing task completion time with the execution set method
- Scheduling malleable tasks with interdependent processing rates: comments and observations
- A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
- Parallel machine scheduling with a convex resource consumption function
- Coupled task scheduling with convex resource consumption functions
- Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect
- Single-machine batch scheduling problem with job rejection and resource dependent processing times
- Allocation of resources in project management
- A note on resource allocation scheduling with position-dependent workloads
- Resource constrained scheduling with general truncated job-dependent learning effect
- Bicriterion scheduling with truncated learning effects and convex controllable processing times
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
- Bicriteria permutation flow shop scheduling problems with machine-dependent convex resource consumption functions
- Minimizing total completion time in single-machine scheduling with convex resource consumption and job rejection
- Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities
- Coordinating scheduling and resource allocation decisions in a proportionate flow-shop scheduling environment
- A preemptive single-machine scheduling problem with a late work criterion and convex resource consumption functions
- Single-machine scheduling with controllable processing times: a complexity dichotomy and a faster algorithm
- Single machine batch scheduling to minimize total completion time and resource consumption costs
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- Just-in-time scheduling with controllable processing times on parallel machines
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- A search method for optimal control of a flow shop system of traditional machines
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
This page was built for publication: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5749161)
