The resource dependent assignment problem with a convex agent cost function

DOI10.1016/j.ejor.2017.03.004zbMath1403.90376OpenAlexW2592925171WikidataQ59281087 ScholiaQ59281087MaRDI QIDQ1753596

Dvir Shabtay, Liron Yedidsion

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

schedulingapproximation algorithmassignment problembicriteria 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Maximizing the minimum load for selfish agents
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• Proper efficiency and the theory of vector maximization
• Multicriteria scheduling problems: a survey
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Cost-effectiveness of a preventive counseling and support package for postnatal depression
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases

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