This paper analyzes a single-machine scheduling problem with family setup times both from an optimization and a cost allocation perspective. In a so-called family sequencing situation jobs are processed on a single machine, there is an initial processing order on the jobs, and every job within a...

Game theoretic analysis of sequencing situations has been restricted to manufacturing systems which consist of machines that can process only one job at a time. However, in many manufacturing systems, operations are carried out by batch machines which can simultaneously process multiple jobs....

A highway problem is determined by a connected graph which provides all potential entry and exit vertices and all possible edges that can be constructed between vertices, a cost function on the edges of the graph and a set of players, each in need of constructing a connection between a specific...

In this paper we consider spanning tree problems, where n players want to be connected to a source as cheap as possible. We introduce and analyze (n!) vertex oriented construct and charge procedures for such spanning tree situations leading in n steps to a minimum cost spanning tree and a cost...

In this paper we study hedonic coalition formation games in which players' preferences over coalitions are induced by a semi-value of a monotonic simple game with veto control. We consider partitions of the player set in which the winning coalition contains the union of all minimal winning...