Sequencing games with Just-in-Time arrival, and related games

E.R.M.A. Lohmann, P.E.M. Borm, M. Slikker

Research output: Contribution to journalArticleScientificpeer-review

Abstract

In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of one-machine sequencing situations assumes that a job is available to be handled by the machine as soon as its predecessor is finished. A basic predecessor dependent set-up time is incorporated in the model. Sequencing situations with JiT arrival are first analyzed from an operations research perspective: for a subclass an algorithm is provided to obtain an optimal order. Secondly, we analyze the allocation problem of the minimal joint cost from a game theoretic perspective. A corresponding sequencing game is defined followed by an analysis of a context-specific rule that leads to core elements of this game.
Original languageEnglish
Pages (from-to)285-305
JournalMathematical Methods of Operations Research
Volume80
Issue number3
Early online date22 Oct 2014
DOIs
Publication statusPublished - Dec 2014

Fingerprint

Operations research
Arrival Time
Sequencing
Game
Costs
Setup Times
Operations Research
Just-in-time
Dependent

Keywords

  • just-in-time arrival
  • set-up time
  • sequencing situations
  • cooperative game theory
  • core
  • nucleolus

Cite this

@article{b831fa188a7f4bc3808e131595630745,
title = "Sequencing games with Just-in-Time arrival, and related games",
abstract = "In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of one-machine sequencing situations assumes that a job is available to be handled by the machine as soon as its predecessor is finished. A basic predecessor dependent set-up time is incorporated in the model. Sequencing situations with JiT arrival are first analyzed from an operations research perspective: for a subclass an algorithm is provided to obtain an optimal order. Secondly, we analyze the allocation problem of the minimal joint cost from a game theoretic perspective. A corresponding sequencing game is defined followed by an analysis of a context-specific rule that leads to core elements of this game.",
keywords = "just-in-time arrival, set-up time, sequencing situations, cooperative game theory, core, nucleolus",
author = "E.R.M.A. Lohmann and P.E.M. Borm and M. Slikker",
year = "2014",
month = "12",
doi = "10.1007/s00186-014-0481-x",
language = "English",
volume = "80",
pages = "285--305",
journal = "Mathematical Methods of Operations Research",
issn = "1432-2994",
publisher = "SPRINGER HEIDELBERG",
number = "3",

}

Sequencing games with Just-in-Time arrival, and related games. / Lohmann, E.R.M.A.; Borm, P.E.M.; Slikker, M.

In: Mathematical Methods of Operations Research, Vol. 80, No. 3, 12.2014, p. 285-305.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Sequencing games with Just-in-Time arrival, and related games

AU - Lohmann, E.R.M.A.

AU - Borm, P.E.M.

AU - Slikker, M.

PY - 2014/12

Y1 - 2014/12

N2 - In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of one-machine sequencing situations assumes that a job is available to be handled by the machine as soon as its predecessor is finished. A basic predecessor dependent set-up time is incorporated in the model. Sequencing situations with JiT arrival are first analyzed from an operations research perspective: for a subclass an algorithm is provided to obtain an optimal order. Secondly, we analyze the allocation problem of the minimal joint cost from a game theoretic perspective. A corresponding sequencing game is defined followed by an analysis of a context-specific rule that leads to core elements of this game.

AB - In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of one-machine sequencing situations assumes that a job is available to be handled by the machine as soon as its predecessor is finished. A basic predecessor dependent set-up time is incorporated in the model. Sequencing situations with JiT arrival are first analyzed from an operations research perspective: for a subclass an algorithm is provided to obtain an optimal order. Secondly, we analyze the allocation problem of the minimal joint cost from a game theoretic perspective. A corresponding sequencing game is defined followed by an analysis of a context-specific rule that leads to core elements of this game.

KW - just-in-time arrival

KW - set-up time

KW - sequencing situations

KW - cooperative game theory

KW - core

KW - nucleolus

U2 - 10.1007/s00186-014-0481-x

DO - 10.1007/s00186-014-0481-x

M3 - Article

VL - 80

SP - 285

EP - 305

JO - Mathematical Methods of Operations Research

JF - Mathematical Methods of Operations Research

SN - 1432-2994

IS - 3

ER -