Preparation Sequencing Situations and Related Games
AbstractIn this paper preparation sequencing situations are introduced. This new type of onemachine sequencing situations assumes that before a job can start, some preparation depending on its predecessor is required. Preparation sequencing situations are first analyzed from an operations research perspective: optimality conditions are provided and 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 preparation sequencing game is defined and the focus is on the core and nucleolus of such games.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2010-31.
Date of creation: 2010
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
preparation times; sequencing situations; cooperative game theory; core; nucleolus;
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-05-02 (All new papers)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Grundel, S. & Ciftci, B.B. & Borm, P.E.M. & Hamers, H.J.M., 2012.
"Family Sequencing and Cooperation,"
2012-040, Tilburg University, Center for Economic Research.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.