The resource dependent assignment problem with a convex agent cost function

DOI10.1016/J.EJOR.2017.03.004MaRDI QIDQ1753596zbMATH OpenOpenAlexWikidataFDO

Authors Liron Yedidsion, Dvir Shabtay

Publication date 29 May 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2017.03.004

zbMATH Keywords

assignment problemapproximation algorithmschedulingbicriteria optimizationcontrollable processing times

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Recommendations

• A pseudo-polynomial time algorithm for solving the resource dependent assignment problem
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• Resource allocation problem under single resource assignment
• Algorithms for the Multi-Resource Generalized Assignment Problem
• scientific article; zbMATH DE number 1302182

Cites work

• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Cost-effectiveness of a preventive counseling and support package for postnatal depression
• Maximizing the minimum load for selfish agents
• Multicriteria scheduling problems: a survey
• Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
• Proper efficiency and the theory of vector maximization
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• Tight results for next fit and worst fit with resource augmentation

Cited in

(8)

• Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments
• Resource allocation problem under single resource assignment
• Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations
• A pseudo-polynomial time algorithm for solving the resource dependent assignment problem
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning
• Resource allocation problems with concave reward functions
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

This page was built for publication: The resource dependent assignment problem with a convex agent cost function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753596)