In this paper we introduce several classes of cooperative games associated to 1-machine sequencing situations in which the initial order is partially or completely unspecified. Properties of the games are studied and the core is analyzed in detail. JEL classification: C71, C78 Running head: Sequencing Games without Initial Orde
This paper considers a special class of sequencing situations with two parallel machines in which ea...
In this paper we consider one-machine sequencing situations with interval data. We present different...
We study sequencing situations with a fixed initial order and linear cost functions. Cost savings ca...
In this note we study uncertainty sequencing situations, i.e., 1-machine sequencing situations in wh...
In this paper we study a class of cooperative sequencing games that arise from one-machine sequencin...
In this paper a new class of relaxed sequencing games is introduced: the class of Step out-Step in s...
In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of...
In this paper preparation sequencing situations are introduced. This new type of onemachine sequenci...
The interaction between sequencing situations and cooperative games starting from the paper of Curie...
In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of...
In this paper a new class of relaxed sequencing games is introduced: the class of Step out–Step in s...
In this paper we study a class of cooperative sequencing games that arise from one-machine sequencin...
Abstract We study m-sequencing games, which were introduced by [Hamers, H., Klijn, F., Suijs, J., (1...
This paper considers a special class of sequencing situations with two parallel machines in which ea...
In this paper we consider one-machine sequencing situations with interval data. We present different...
We study sequencing situations with a fixed initial order and linear cost functions. Cost savings ca...
In this note we study uncertainty sequencing situations, i.e., 1-machine sequencing situations in wh...
In this paper we study a class of cooperative sequencing games that arise from one-machine sequencin...
In this paper a new class of relaxed sequencing games is introduced: the class of Step out-Step in s...
In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of...
In this paper preparation sequencing situations are introduced. This new type of onemachine sequenci...
The interaction between sequencing situations and cooperative games starting from the paper of Curie...
In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of...
In this paper a new class of relaxed sequencing games is introduced: the class of Step out–Step in s...
In this paper we study a class of cooperative sequencing games that arise from one-machine sequencin...
Abstract We study m-sequencing games, which were introduced by [Hamers, H., Klijn, F., Suijs, J., (1...
This paper considers a special class of sequencing situations with two parallel machines in which ea...
In this paper we consider one-machine sequencing situations with interval data. We present different...
We study sequencing situations with a fixed initial order and linear cost functions. Cost savings ca...