Shapley value for parallel machine sequencing situation without initial order (Q1665679)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Shapley value for parallel machine sequencing situation without initial order |
scientific article; zbMATH DE number 6926359
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shapley value for parallel machine sequencing situation without initial order |
scientific article; zbMATH DE number 6926359 |
Statements
Shapley value for parallel machine sequencing situation without initial order (English)
0 references
27 August 2018
0 references
Summary: 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.
0 references
