IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/46a07ce4-57fe-4a08-bcb5-cf84c1be6401.html
   My bibliography  Save this paper

On the Convexity of Games Corresponding to Sequencing Situations with Due Dates

Author

Listed:
  • Borm, P.E.M.

    (Tilburg University, Center For Economic Research)

  • Fiestras-Janeiro, G.
  • Hamers, H.J.M.

    (Tilburg University, Center For Economic Research)

  • Sánchez, E.
  • Voorneveld, M.

    (Tilburg University, Center For Economic Research)

Abstract

This paper considers sequencing situations with due date criteria. Three different types of criteria are considered: the weighted penalty criterion, the weighted tardiness criterion and the completion time criterion. The main focus is on convexity of the associated cooperative games.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Borm, P.E.M. & Fiestras-Janeiro, G. & Hamers, H.J.M. & Sánchez, E. & Voorneveld, M., 1999. "On the Convexity of Games Corresponding to Sequencing Situations with Due Dates," Discussion Paper 1999-49, Tilburg University, Center for Economic Research.
    • Handle: RePEc:tiu:tiucen:46a07ce4-57fe-4a08-bcb5-cf84c1be6401
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/1105805/Games.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Hamers, H.J.M. & Borm, P.E.M. & Tijs, S.H., 1993. "On games corresponding to sequencing situations with ready times," Other publications TiSEM 8e2af556-5430-4f98-9334-c, Tilburg University, School of Economics and Management.
    2. Suijs, Jeroen & Borm, Peter, 1999. "Stochastic Cooperative Games: Superadditivity, Convexity, and Certainty Equivalents," Games and Economic Behavior, Elsevier, vol. 27(2), pages 331-345, May.
    3. Curiel, I. & Potters, J.A.M. & Rajendra Prasad, V. & Tijs, S.H. & Veltman, B., 1993. "Cooperation in one machine scheduling," Other publications TiSEM 9c5ceec5-2080-4b5c-98d5-0, Tilburg University, School of Economics and Management.
    4. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
    5. Hamers, H.J.M., 1995. "Sequencing and delivery situations : A game theoretic approach," Other publications TiSEM f2cbf2cf-aa4e-4f9d-b46d-7, Tilburg University, School of Economics and Management.
    6. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    7. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    2. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "On the convexity of step out–step in sequencing games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 68-109, April.
    3. Musegaas, M. & Borm, P.E.M. & Quant, M., 2015. "Step out–Step in sequencing games," European Journal of Operational Research, Elsevier, vol. 246(3), pages 894-906.
    4. Min Ji & Sai Liu & Xiaolin Zhang & Keke Cao & T. C. E. Cheng, 2017. "Sequencing Games with Slack Due Windows and Group Technology Considerations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 121-133, February.
    5. Gerichhausen, Marloes & Hamers, Herbert, 2009. "Partitioning sequencing situations and games," European Journal of Operational Research, Elsevier, vol. 196(1), pages 207-216, July.
    6. Pedro Calleja & Peter Borm & Herbert Hamers & Flip Klijn & Marco Slikker, 2002. "On a New Class of Parallel Sequencing Situations and Related Games," Annals of Operations Research, Springer, vol. 109(1), pages 265-277, January.
    7. Hamers, H.J.M. & Slikker, M., 1995. "The pegs-rule for probabilistic sequencing situations," Research Memorandum FEW 703, Tilburg University, School of Economics and Management.
    8. Ciftci, B.B. & Borm, P.E.M. & Hamers, H.J.M. & Slikker, M., 2008. "Batch Sequencing and Cooperation," Other publications TiSEM ed1f8fce-da76-41a6-9a9e-9, Tilburg University, School of Economics and Management.
    9. Imma Curiel, 2010. "Multi-stage sequencing situations," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 151-162, March.
    10. Hamers, H.J.M., 1996. "Generalized Sequencing Games," Research Memorandum 714, Tilburg University, School of Economics and Management.
    11. Marieke Quant & Marc Meertens & Hans Reijnierse, 2008. "Processing games with shared interest," Annals of Operations Research, Springer, vol. 158(1), pages 219-228, February.
    12. van Velzen, S. & Hamers, H.J.M., 2002. "On the Balancedness of Relaxed Sequencing Games," Discussion Paper 2002-49, Tilburg University, Center for Economic Research.
    13. Reijnierse, Hans & Borm, Peter & Quant, Marieke & Meertens, Marc, 2010. "Processing games with restricted capacities," European Journal of Operational Research, Elsevier, vol. 202(3), pages 773-780, May.
    14. Suijs, Jeroen & Borm, Peter & De Waegenaere, Anja & Tijs, Stef, 1999. "Cooperative games with stochastic payoffs," European Journal of Operational Research, Elsevier, vol. 113(1), pages 193-205, February.
    15. Nong, Q.Q. & Cheng, T.C.E. & Ng, C.T., 2011. "Two-agent scheduling to minimize the total cost," European Journal of Operational Research, Elsevier, vol. 215(1), pages 39-44, November.
    16. 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.
    17. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    18. Lohmann, E.R.M.A. & Borm, P.E.M. & Slikker, M., 2010. "Preparation Sequencing Situations and Related Games," Other publications TiSEM 667d8f5d-4c0d-4610-970d-6, Tilburg University, School of Economics and Management.
    19. Fragnelli, V. & Llorca, N. & Sánchez-Soriano, J. & Tijs, S.H., 2006. "Convex Games with Countable Number of Players and Sequencing Situations," Discussion Paper 2006-119, Tilburg University, Center for Economic Research.
    20. Arantza Estévez-Fernández & Peter Borm & Pedro Calleja & Herbert Hamers, 2008. "Sequencing games with repeated players," Annals of Operations Research, Springer, vol. 158(1), pages 189-203, February.

    More about this item

    Keywords

    Sequencing situations; Due date criteria; Cooperative games; Convexity;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    Statistics

    Access and download statistics

    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:tiu:tiucen:46a07ce4-57fe-4a08-bcb5-cf84c1be6401. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: Richard Broekman (email available below). General contact details of provider: http://center.uvt.nl .

    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.