Sequencing situations with just-in-time arrival, and related games

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

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
104 Downloads (Pure)

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
Number of pages21
JournalMathematical Methods of Operations Research
Volume80
Issue number3
DOIs
Publication statusPublished - 2014

Fingerprint Dive into the research topics of 'Sequencing situations with just-in-time arrival, and related games'. Together they form a unique fingerprint.

  • Cite this