Processing games with restricted capacities
Hans Reijnierse (),
Peter Borm,
Marieke Quant and
Marc Meertens
European Journal of Operational Research, 2010, vol. 202, issue 3, 773-780
Abstract:
This paper analyzes processing problems and related cooperative games. In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times. The main feature of the model is a capacity restriction, i.e., there is a maximum amount of effort per time unit available for handling jobs. There are no other restrictions whatsoever on the processing schedule. Assigning to each job a player and letting each player have an individual capacity for handling jobs, each coalition of cooperating players in fact faces a processing problem with the coalitional capacity being the sum of the individual capacities of the members. The corresponding processing game summarizes the minimal joint costs for every coalition. It turns out that processing games are totally balanced. The proof of this statement is constructive and provides a core element in polynomial time.
Keywords: Scheduling; Individual; capacity; Cooperation; Core; allocation (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00450-0
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:202:y:2010:i:3:p:773-780
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().