Sequencing Games with Controllable Processing Time

S. van Velzen

Research output: Working paperDiscussion paperOther research output

246 Downloads (Pure)

Abstract

In this paper we study a class of cooperative sequencing games that arise from sequencing situations in which the processing times are not fixed.We show that these games are balanced by obtaining two core elements that depend only on the optimal schedule for the grand coalition.Furthermore we show that, although these games are not convex in general, many marginal vectors are core elements. We also consider convexity for special instances of the sequencing situation.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages23
Volume2003-105
Publication statusPublished - 2003

Publication series

NameCentER Discussion Paper
Volume2003-105

Fingerprint

Sequencing
Convexity
Schedule

Keywords

  • cooperative games

Cite this

van Velzen, S. (2003). Sequencing Games with Controllable Processing Time. (CentER Discussion Paper; Vol. 2003-105). Tilburg: Operations research.
van Velzen, S. / Sequencing Games with Controllable Processing Time. Tilburg : Operations research, 2003. (CentER Discussion Paper).
@techreport{11af3da01a014be4bed7166b3943fc8d,
title = "Sequencing Games with Controllable Processing Time",
abstract = "In this paper we study a class of cooperative sequencing games that arise from sequencing situations in which the processing times are not fixed.We show that these games are balanced by obtaining two core elements that depend only on the optimal schedule for the grand coalition.Furthermore we show that, although these games are not convex in general, many marginal vectors are core elements. We also consider convexity for special instances of the sequencing situation.",
keywords = "cooperative games",
author = "{van Velzen}, S.",
note = "Pagination: 23",
year = "2003",
language = "English",
volume = "2003-105",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

van Velzen, S 2003 'Sequencing Games with Controllable Processing Time' CentER Discussion Paper, vol. 2003-105, Operations research, Tilburg.

Sequencing Games with Controllable Processing Time. / van Velzen, S.

Tilburg : Operations research, 2003. (CentER Discussion Paper; Vol. 2003-105).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Sequencing Games with Controllable Processing Time

AU - van Velzen, S.

N1 - Pagination: 23

PY - 2003

Y1 - 2003

N2 - In this paper we study a class of cooperative sequencing games that arise from sequencing situations in which the processing times are not fixed.We show that these games are balanced by obtaining two core elements that depend only on the optimal schedule for the grand coalition.Furthermore we show that, although these games are not convex in general, many marginal vectors are core elements. We also consider convexity for special instances of the sequencing situation.

AB - In this paper we study a class of cooperative sequencing games that arise from sequencing situations in which the processing times are not fixed.We show that these games are balanced by obtaining two core elements that depend only on the optimal schedule for the grand coalition.Furthermore we show that, although these games are not convex in general, many marginal vectors are core elements. We also consider convexity for special instances of the sequencing situation.

KW - cooperative games

M3 - Discussion paper

VL - 2003-105

T3 - CentER Discussion Paper

BT - Sequencing Games with Controllable Processing Time

PB - Operations research

CY - Tilburg

ER -

van Velzen S. Sequencing Games with Controllable Processing Time. Tilburg: Operations research. 2003. (CentER Discussion Paper).