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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Applied Mathematics Ročník 182; s. 115 - 121
Hlavní autori: Shabtay, Dvir, Steiner, George, Yedidsion, Liron
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 19.02.2015
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract 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 the agent. A solution for the RDAP problem is defined by the assignment of agents to tasks and by a resource allocation to each agent. The quality of a solution is measured by two criteria. The first criterion is the total assignment cost and the second one is the total weighted resource consumption. Yedidsion et al. showed that the bicriteria variations of the problem are all NP-hard for any given set of task costs. However, whether these problems are strongly or ordinarily NP-hard remained an open question. In this paper we close this gap by providing pseudo-polynomial time algorithms for solving these problems.
AbstractList In this paper the resource dependent assignment problem (RDAP) is considered. In the RDAP the cost of assigning agent to task is a multiplication of task 's cost parameter by a cost function of agent and the cost function of agent is a linear function of the amount of resource allocated to the agent. A solution for the RDAP problem is defined by the assignment of agents to tasks and by a resource allocation to each agent. The quality of a solution is measured by two criteria. The first criterion is the total assignment cost and the second one is the total weighted resource consumption. Yedidsion et al. showed that the bicriteria variations of the problem are all -hard for any given set of task costs. However, whether these problems are strongly or ordinarily -hard remained an open question. In this paper we close this gap by providing pseudo-polynomial time algorithms for solving these problems.
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 the agent. A solution for the RDAP problem is defined by the assignment of agents to tasks and by a resource allocation to each agent. The quality of a solution is measured by two criteria. The first criterion is the total assignment cost and the second one is the total weighted resource consumption. Yedidsion et al. showed that the bicriteria variations of the problem are all NP-hard for any given set of task costs. However, whether these problems are strongly or ordinarily NP-hard remained an open question. In this paper we close this gap by providing pseudo-polynomial time algorithms for solving these problems.
Author Steiner, George
Yedidsion, Liron
Shabtay, Dvir
Author_xml – sequence: 1
  givenname: Dvir
  surname: Shabtay
  fullname: Shabtay, Dvir
  email: dvirs@bgu.ac.il
  organization: Department of Industrial Engineering and Management, Ben-Gurion University of the Negev Beer-Sheva, Israel
– sequence: 2
  givenname: George
  surname: Steiner
  fullname: Steiner, George
  email: steiner@mcmaster.ca
  organization: Operations Management Area, DeGroote School of Business, McMaster University, Hamilton, Ontario, Canada
– sequence: 3
  givenname: Liron
  surname: Yedidsion
  fullname: Yedidsion, Liron
  email: lirony@ie.technion.ac.il
  organization: Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel
BookMark eNp9kE1LxDAQhoMouK7-AG85emlNGtukeFrELxC8KHgLaTLdzZImNckK_nuzrCcPnmYG3meGec7QsQ8eELqkpKaEdtfb2qipbghlNRE1YfwILajgTdVxTo_RomS6qqHi4xSdpbQlhNAyLdDHCs8JdiZUc3DfPkxWOZztBFi5dYg2byY8hohTcF_Wr3HeAI6Qwi5qwAZm8AZ8xiolu_bTvp1jGBxM5-hkVC7BxW9doveH-7e7p-rl9fH5bvVSadaxXI3AlDEDYXpgQFVLmmGgzAyd7jnr-dBo04v2xsDYty1XjAtD2qbjvehHKqhiS3R12Fvufu4gZTnZpME55SHskix_96Jr21aUKD1EdQwpRRjlHO2k4rekRO4tyq0sFuXeoiRCFouF4X8YbbPKNvgclXX_krcHEsr3XxaiTNqC12BsBJ2lCfYf-gcXZJA-
CitedBy_id crossref_primary_10_1108_K_08_2016_0221
crossref_primary_10_1016_j_cie_2020_107024
Cites_doi 10.1016/j.dam.2007.02.003
10.1080/05695558008974515
10.1016/j.dam.2011.04.001
ContentType Journal Article
Copyright 2013 Elsevier B.V.
Copyright_xml – notice: 2013 Elsevier B.V.
DBID 6I.
AAFTH
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.dam.2013.08.037
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1872-6771
EndPage 121
ExternalDocumentID 10_1016_j_dam_2013_08_037
S0166218X13003788
GroupedDBID -~X
6I.
AAFTH
ADEZE
AFTJW
ALMA_UNASSIGNED_HOLDINGS
FDB
OAUVE
AAYXX
AI.
CITATION
FA8
VH1
WUQ
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c363t-fe3addb03cb3e1a502bb13db6c97397b2cd9854def9557a378d05267989f181a3
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000349877300013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0166-218X
IngestDate Sun Nov 09 09:54:01 EST 2025
Sat Nov 29 02:59:33 EST 2025
Tue Nov 18 22:34:38 EST 2025
Sat Apr 29 22:45:09 EDT 2023
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Assignment problem
Bicriteria optimization
Pseudo-polynomial time algorithm
Resource allocation
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c363t-fe3addb03cb3e1a502bb13db6c97397b2cd9854def9557a378d05267989f181a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
OpenAccessLink https://dx.doi.org/10.1016/j.dam.2013.08.037
PQID 1669865558
PQPubID 23500
PageCount 7
ParticipantIDs proquest_miscellaneous_1669865558
crossref_primary_10_1016_j_dam_2013_08_037
crossref_citationtrail_10_1016_j_dam_2013_08_037
elsevier_sciencedirect_doi_10_1016_j_dam_2013_08_037
PublicationCentury 2000
PublicationDate 2015-02-19
PublicationDateYYYYMMDD 2015-02-19
PublicationDate_xml – month: 02
  year: 2015
  text: 2015-02-19
  day: 19
PublicationDecade 2010
PublicationTitle Discrete Applied Mathematics
PublicationYear 2015
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Hardy, Littlewood, Polya (br000005) 1934
Yedidsion, Shabtay, Kaspi (br000020) 2011; 159
Vickson (br000015) 1980; 12
Shabtay, Steiner (br000010) 2007; 155
Hardy (10.1016/j.dam.2013.08.037_br000005) 1934
Shabtay (10.1016/j.dam.2013.08.037_br000010) 2007; 155
Vickson (10.1016/j.dam.2013.08.037_br000015) 1980; 12
Yedidsion (10.1016/j.dam.2013.08.037_br000020) 2011; 159
References_xml – volume: 155
  start-page: 1643
  year: 2007
  end-page: 1666
  ident: br000010
  article-title: A survey of scheduling with controllable processing times
  publication-title: Discrete Applied Mathematics
– year: 1934
  ident: br000005
  article-title: Inequalities
– volume: 159
  start-page: 1264
  year: 2011
  end-page: 1278
  ident: br000020
  article-title: Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
  publication-title: Discrete Applied Mathematics
– volume: 12
  start-page: 258
  year: 1980
  end-page: 262
  ident: br000015
  article-title: Two single machine sequencing problems involving controllable job processing times
  publication-title: AIIE Transactions
– year: 1934
  ident: 10.1016/j.dam.2013.08.037_br000005
– volume: 155
  start-page: 1643
  issue: 13
  year: 2007
  ident: 10.1016/j.dam.2013.08.037_br000010
  article-title: A survey of scheduling with controllable processing times
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/j.dam.2007.02.003
– volume: 12
  start-page: 258
  issue: 3
  year: 1980
  ident: 10.1016/j.dam.2013.08.037_br000015
  article-title: Two single machine sequencing problems involving controllable job processing times
  publication-title: AIIE Transactions
  doi: 10.1080/05695558008974515
– volume: 159
  start-page: 1264
  issue: 12
  year: 2011
  ident: 10.1016/j.dam.2013.08.037_br000020
  article-title: Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/j.dam.2011.04.001
SSID ssj0001218
ssj0000186
ssj0006644
Score 2.0716367
Snippet 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...
In this paper the resource dependent assignment problem (RDAP) is considered. In the RDAP the cost of assigning agent to task is a multiplication of task 's...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 115
SubjectTerms Algorithms
Assignment problem
Bicriteria optimization
Consumption
Cost function
Criteria
Functions (mathematics)
Mathematical analysis
Operations research
Pseudo-polynomial time algorithm
Resource allocation
Tasks
Title A pseudo-polynomial time algorithm for solving the resource dependent assignment problem
URI https://dx.doi.org/10.1016/j.dam.2013.08.037
https://www.proquest.com/docview/1669865558
Volume 182
WOSCitedRecordID wos000349877300013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3da9swEBdZu4fuoeyTdd2GBntaMMSfsh7D1rGNrQzSgd-MZMmrS2oHxwntf787S_4gYWUb7MUEExlF9_Ppl9Pd7wh5G8ykl88C6fhCew52NHak5mCQXHpMS5mHblso_JWdn8dJwr9PJrddLcx2ycoyvrnhq_9qargHxsbS2b8wd_9QuAGfwehwBbPD9Y8MP5-u1nqjKmdVLW-x6LgtDLnWU7H8WdVFc3ndphbCJLZdqVRtY_jTriUutp_BzI42U8D2nBnT2A8FeBug2z2J_darv_YcfXEpZCPMIf226HOAF9he0-DExOOHqK0qFMbuTKigtnixEQm3rfAe-b39UhkTuYwiB_hEYjYe421j5jkRMz1YBnfsjRyqa4o97d7smmrqPbdvIhBXMCUUF3D9VpXViMnsqGkvcB44DTzGQy39e-TQYyEHh3g4_3yWfBlpj6Gw3lEXrRsOp4CkBVYy3vyi7rC8TRvcmcLv6M7Oxt-ymYuH5Nj-DaFzA59HZKLLx-TByIpPSDKne0CiCCTaA4kCkKgFEoWhtAMS7YFEByBRC6Sn5MfHs4v3nxzbh8PJ_MhvnFz7sAvKmZ9JX7sinHlSur6SUcYZ0FnpZYrHYaB0zsOQCVhVhSpCjMc8BwIp_GfkoKxK_ZxQBi-_jAXTmcpQligG9uqFQgWe0hkw0RMy65YrzaxIPfZKWaZdNuJVCiuc4gqn2D_VZyfkXT9kZRRa7vpy0NkgtRTTUMcUoHTXsDedvVJwv3imJkpdbdYpYIBjbXcYv_i3R5-So-EdekkOmnqjX5H72bYp1vVrC8pfwuqsCg
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+pseudo-polynomial+time+algorithm+for+solving+the+resource+dependent+assignment+problem&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Shabtay%2C+Dvir&rft.au=Steiner%2C+George&rft.au=Yedidsion%2C+Liron&rft.date=2015-02-19&rft.pub=Elsevier+B.V&rft.issn=0166-218X&rft.eissn=1872-6771&rft.volume=182&rft.spage=115&rft.epage=121&rft_id=info:doi/10.1016%2Fj.dam.2013.08.037&rft.externalDocID=S0166218X13003788
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon