IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v42y1994i3p566-568.html
   My bibliography  Save this article

Sequencing and Cooperation

Author

Listed:
  • Imma Curiel

    (University of Maryland, Baltimore County, Cantonsville, Maryland)

  • Jos Potters

    (University of Nijmegen, Nijmegen, The Netherlands)

  • Rajendra Prasad

    (Indian Statistical Institute, Bangalore, India)

  • Stef Tijs

    (Tilburg University, Tilburg, The Netherlands)

  • Bart Veltman

    (Center for Mathematics and Computer Science, Amsterdam, The Netherlands)

Abstract

In machine scheduling the first problem is to find a timetable that is optimal with respect to some efficiency criterion. If the jobs come from different clients the solution of the optimization problem is not the end of the story. In addition, we have to decide how the minimal total cost must be distributed among the parties involved. In this note, cost allocation problems will be considered to arise from one-machine scheduling problems with an additive and weakly increasing cost function. We will show that the cooperative games related to these cost allocation problems have a nonempty core. Furthermore, we give a rule that assigns a core element of the associated cost saving game to each scheduling problem of this kind and an initial order of the jobs.

Suggested Citation

  • Imma Curiel & Jos Potters & Rajendra Prasad & Stef Tijs & Bart Veltman, 1994. "Sequencing and Cooperation," Operations Research, INFORMS, vol. 42(3), pages 566-568, June.
    • Handle: RePEc:inm:oropre:v:42:y:1994:i:3:p:566-568
    DOI: 10.1287/opre.42.3.566
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.42.3.566
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.42.3.566?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:42:y:1994:i:3:p:566-568. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.