This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Sequencing games with controllable processing times

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Velzen, S. van (Tilburg University, Center for Economic Research)
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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://arno.uvt.nl/show.cgi?fid=10462
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 105.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 2003
Date of revision:
Handle: RePEc:dgr:kubcen:2003105

Contact details of provider:
Web page: http://center.uvt.nl

For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).

Related research
Keywords:

Other versions of this item:

This paper has been announced in the following NEP Reports: References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
  1. Alidaee, Bahram & Ahmadian, Ahmad, 1993. "Two parallel machine sequencing problems involving controllable job processing times," European Journal of Operational Research, Elsevier, vol. 70(3), pages 335-341, November. [Downloadable!] (restricted)
  2. Hamers, H. & Borm, P. & Tijs, S., 1993. "A Games Corresponding to Sequencing Situations with Ready Times," Papers 9316, Tilburg - Center for Economic Research.
  3. Calleja, P. & Borm, P. & Hamers, H., 2001. "On a new class of parallel sequencing situations and related games," Discussion Paper 3, Tilburg University, Center for Economic Research. [Downloadable!]
  4. Hamers, Herbert & Klijn, Flip & Suijs, Jeroen, 1999. "On the balancedness of multiple machine sequencing games," European Journal of Operational Research, Elsevier, vol. 119(3), pages 678-691, December. [Downloadable!] (restricted)
  5. Hamers, H. & Klijn, P. & Velzen, B. van, 2002. "On the convexity of precedence sequencing games," Discussion Paper 112, Tilburg University, Center for Economic Research. [Downloadable!]
Full references

Statistics
Access and download statistics

Did you know? RePEc and its associated services are free for contributors and users, and do not accept any advertising.

This page was last updated on 2009-12-21.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.