Shapley Value for Parallel Machine Sequencing Situation without Initial Order

Shanshan Liu and Zhaohui Liu

Mathematical Problems in Engineering, 2015, vol. 2015, 1-6

Abstract:

We consider the parallel identical machine sequencing situation without initial schedule. For the situation with identical job processing time, we design a cost allocation rule which gives the Shapley value of the related sequencing game in polynomial time. For the game with identical job weight, we also present a polynomial time procedure to compute the Shapley value.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/437403.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/437403.xml (text/xml)

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:hin:jnlmpe:437403

DOI: 10.1155/2015/437403

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().