A pseudo-polynomial time algorithm for solving the resource dependent assignment problem

In this paper the resource dependent assignment problem (RDAP) is considered. In the RDAP the cost of assigning agent j to task i is a multiplication of task i’s cost parameter by a cost function of agent j and the cost function of agent j is a linear function of the amount of resource allocated to...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 182; pp. 115 - 121
Main Authors:	Shabtay, Dvir, Steiner, George, Yedidsion, Liron
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 19.02.2015
Subjects:	Algorithms Assignment problem Bicriteria optimization Consumption Cost function Criteria Functions (mathematics) Mathematical analysis Operations research Pseudo-polynomial time algorithm Resource allocation Tasks Assignment problem Bicriteria optimization Pseudo-polynomial time algorithm Resource allocation
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!