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...

This note provides a methodological contribution to the allocation of joint revenues obtained from passepartouts. In a passepartout system a group of service providers offers a passepartout that allows its owners the use of specified services for an unlimited number of times during a fixed...