The Basic Core of a Parallel Machines Scheduling Game

Tzvi Alon () and Shoshana Anily ()
Additional contact information
Tzvi Alon: Department of Statistics and Federmann Center for the Study of Rationality, Hebrew University of Jerusalem, 9190501 Jerusalem, Israel
Shoshana Anily: Coller School of Management, Tel Aviv University, 6997801 Tel Aviv, Israel

Manufacturing & Service Operations Management, 2023, vol. 25, issue 6, 2233-2248

Abstract: Problem definition : We consider the parallel machine scheduling (PMS) under job-splitting game defined by a set of manufacturers where each holds uniform parallel machines and each is committed to produce some jobs submitted to her by her clients while bearing the cost of the sum of completion times of her jobs on her machines. An efficient algorithm for this scheduling problem is well known. We consider the corresponding cooperative game, where the manufacturers are players that want to join forces. We show that collaboration is profitable. Yet, the stability of the cooperation depends on the cost allocation scheme; we focus on the core of the game. Methodology/results : We prove that the PMS game is totally balanced and its core is infinitely large, by developing a sophisticated methodology of linear complexity that finds a line segment in its symmetric core. We call this segment the basic core of the game. Managerial implications : This PMS game has the potential for various applications both in traditional industry and in distributed computing systems in the hi-tech industry. The formation of a partnership among entrepreneurs, companies, or manufacturers necessitates not only a plan for joining forces toward the achievement of the ultimate goals, but also an acceptable agreement regarding the cost allocation among the partners. Core allocations guarantee the stability of the partnership as no subset of players can gain by defecting from the grand coalition.

Keywords: cooperative games; core; parallel machines scheduling; job splitting; distributed computing (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/msom.2021.0337 (application/pdf)

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:inm:ormsom:v:25:y:2023:i:6:p:2233-2248

Access Statistics for this article

More articles in Manufacturing & Service Operations Management from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().