Advanced Search
MyIDEAS: Login

Job Scheduling, Cooperation and Control


Author Info

  • Calleja, P.
  • Estevez Fernandez, M.A.
  • Borm, P.E.M.
  • Hamers, H.J.M.

    (Tilburg University, Center for Economic Research)


This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output.Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic sequencing problems is dropped: the one to one correspondence between clients and jobs.It is shown that the corresponding cooperative games are balanced for specific types of cost criteria.

Download Info

If 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.
File URL:
Download Restriction: no

Bibliographic Info

Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2004-65.

as in new window
Date of creation: 2004
Date of revision:
Handle: RePEc:dgr:kubcen:200465

Contact details of provider:
Web page:

Related research

Keywords: scheduling; cooperation; game theory; cooperative games;

Find related papers by JEL classification:

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.:
as in new window
  1. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
  2. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154243, Tilburg University.
  3. Calleja, P. & Borm, P.E.M. & Hamers, H.J.M. & Klijn, F., 2001. "On a New Class of Parallel Sequencing Situations and Related Games," Discussion Paper 2001-3, Tilburg University, Center for Economic Research.
  4. Hamers, H. & Borm, P. & Tijs, S., 1993. "A Games Corresponding to Sequencing Situations with Ready Times," Papers 9316, Tilburg - Center for Economic Research.
  5. Borm, P.E.M. & Fiestras-Janeiro, G. & Hamers, H.J.M. & Sánchez, E. & Voorneveld, M., 2002. "On the convexity of games corresponding to sequencing situations with due dates," Open Access publications from Tilburg University urn:nbn:nl:ui:12-88223, Tilburg University.
  6. Curiel, I. & Potters, J.A.M. & Rajendra Prasad, V. & Tijs, S.H. & Veltman, B., 1994. "Sequencing and cooperation," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154192, Tilburg University.
  7. Hamers, H.J.M. & Klijn, F. & Suijs, J.P.M., 1998. "On the Balancedness of M-Sequencing Games," Discussion Paper 1998-17, Tilburg University, Center for Economic Research.
Full references (including those not matched with items on IDEAS)


Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Estevez Fernandez, M.A. & Borm, P.E.M. & Calleja, P. & Hamers, H.J.M., 2008. "Sequencing games with repeated players," Open Access publications from Tilburg University urn:nbn:nl:ui:12-195639, Tilburg University.
  2. Estevez Fernandez, M.A. & Mosquera, M.A. & Borm, P.E.M. & Hamers, H.J.M., 2006. "Proportionate Flow Shop Games," Discussion Paper 2006-63, Tilburg University, Center for Economic Research.
  3. Gerichhausen, M. & Hamers, H.J.M., 2007. "Partitioning Sequencing Situations and Games," Discussion Paper 2007-40, Tilburg University, Center for Economic Research.


This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:dgr:kubcen:200465. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.