A combinatorial optimization problem can often be understood as the problem to minimize cost in a complex situation. If more than one party is involved, the solution of the optimization problem is not the end of the story. In addition it has to be decided how the minimal total cost has to be distributed among the parties involved. In this paper cost allocation problems will be considered arising from one-machine scheduling under additive and weakly increasing cost functions. The approach of the problem will be game theoretical and we shall in fact show that in many cases the games related to the cost allocation problems are balanced.
['Imma J. Curiel', 'J.A.M. Potters', 'Rajendra Prasad', 'S.H. Tijs', 'Bart Veltman']
Cooperation in one machine scheduling