Shapley Value for Parallel Machine Sequencing Situation without Initial Order

Abstract EN

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.