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

Autor:	Marco Slikker, Pem Peter Borm, E.R.M.A. Lohmann
Přispěvatelé:	Operations Planning Acc. & Control
Rok vydání:	2014
Předmět:	Core (game theory) Joint cost Theoretical computer science Perspective (geometry) Game theoretic Computer science Order (business) General Mathematics Real-time computing Set up time Management Science and Operations Research Cooperative game theory Software
Zdroj:	Mathematical Methods of Operations Research, 80(3), 285-305. Physica-Verlag
ISSN:	1432-5217 1432-2994
DOI:	10.1007/s00186-014-0481-x
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff94ff5e6a33b775b0e96cc0e836d75c https://doi.org/10.1007/s00186-014-0481-x Zobrazit plný text záznamu Plný text ve formátu PDF