IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v80y2014i3p285-305.html
   My bibliography  Save this article

Sequencing situations with Just-in-Time arrival, and related games

Author

Listed:
  • Edwin Lohmann
  • Peter Borm
  • Marco Slikker

Abstract

In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of one-machine sequencing situations assumes that a job is available to be handled by the machine as soon as its predecessor is finished. A basic predecessor dependent set-up time is incorporated in the model. Sequencing situations with JiT arrival are first analyzed from an operations research perspective: for a subclass 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 sequencing game is defined followed by an analysis of a context-specific rule that leads to core elements of this game. Copyright Springer-Verlag Berlin Heidelberg 2014

Suggested Citation

  • Edwin Lohmann & Peter Borm & Marco Slikker, 2014. "Sequencing situations with Just-in-Time arrival, and related games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(3), pages 285-305, December.
    • Handle: RePEc:spr:mathme:v:80:y:2014:i:3:p:285-305
    DOI: 10.1007/s00186-014-0481-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-014-0481-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-014-0481-x?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Borm, Peter & Fiestras-Janeiro, Gloria & Hamers, Herbert & Sanchez, Estela & Voorneveld, Mark, 2002. "On the convexity of games corresponding to sequencing situations with due dates," European Journal of Operational Research, Elsevier, vol. 136(3), pages 616-634, February.
    2. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Approach for Sequencing Groups of Identical Jobs," Operations Research, INFORMS, vol. 28(6), pages 1347-1359, December.
    3. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Marco Slikker, 2005. "Balancedness of Sequencing Games with Multiple Parallel Machines," Annals of Operations Research, Springer, vol. 137(1), pages 177-189, July.
    6. N.D. Gupta, Jatinder, 1988. "Single facility scheduling with multiple job classes," European Journal of Operational Research, Elsevier, vol. 33(1), pages 42-45, January.
    7. Marina Núñez & Carles Rafels, 2005. "The Böhm–Bawerk horse market: a cooperative analysis," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(3), pages 421-430, September.
    8. Herbert Hamers & Flip Klijn & Bas van Velzen, 2002. "On Games corresponding to Sequencing Situations with Precedence Relations," UFAE and IAE Working Papers 553.02, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    9. 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)

    Citations

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


    Cited by:

    1. 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.
    2. Schouten, Jop & Saavedra-Nieves, Alejandro & Fiestras-Janeiro, G., 2020. "Sequencing Situations and Games with Non-Linear Cost Functions," Other publications TiSEM 3e1db5c9-0f77-4f91-a075-c, Tilburg University, School of Economics and Management.
    3. Saavedra-Nieves, Alejandro & Schouten, Jop & Borm, Peter, 2020. "On interactive sequencing situations with exponential cost functions," European Journal of Operational Research, Elsevier, vol. 280(1), pages 78-89.
    4. Schouten, Jop & Saavedra-Nieves, Alejandro & Fiestras-Janeiro, M. Gloria, 2021. "Sequencing situations and games with non-linear cost functions under optimal order consistency," European Journal of Operational Research, Elsevier, vol. 294(2), pages 734-745.
    5. Schouten, Jop & Saavedra-Nieves, Alejandro & Fiestras-Janeiro, G., 2020. "Sequencing Situations and Games with Non-Linear Cost Functions," Discussion Paper 2020-006, Tilburg University, Center for Economic Research.
    6. Schouten, Jop, 2022. "Cooperation, allocation and strategy in interactive decision-making," Other publications TiSEM d5d41448-8033-4f6b-8ec0-c, Tilburg University, School of Economics and Management.

    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. Lohmann, E.R.M.A. & Borm, P.E.M. & Slikker, M., 2010. "Preparation Sequencing Situations and Related Games," Discussion Paper 2010-31, Tilburg University, Center for Economic Research.
    2. 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.
    3. 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.
    4. 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.
    5. Gerichhausen, M. & Hamers, H.J.M., 2007. "Partitioning Sequencing Situations and Games," Discussion Paper 2007-40, Tilburg University, Center for Economic Research.
    6. Gerichhausen, Marloes & Hamers, Herbert, 2009. "Partitioning sequencing situations and games," European Journal of Operational Research, Elsevier, vol. 196(1), pages 207-216, July.
    7. 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.
    8. Ruud Hendrickx & Jacco Thijssen & Peter Borm, 2012. "Minimum cost spanning tree games and spillover stability," Theory and Decision, Springer, vol. 73(3), pages 441-451, September.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Flip Klijn & Stef Tijs & Marco Slikker, 2001. "A Dual Egalitarian Solution," Economics Bulletin, AccessEcon, vol. 3(10), pages 1-8.
    14. Rodica Brânzei & Vito Fragnelli & Stef Tijs, 2002. "Tree-connected peer group situations and peer group games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(1), pages 93-106, March.
    15. Calleja, P. & Estevez Fernandez, M.A. & Borm, P.E.M. & Hamers, H.J.M., 2004. "Job Scheduling, Cooperation and Control," Other publications TiSEM 05906ac6-b582-4ee7-875e-9, Tilburg University, School of Economics and Management.
    16. Tolga Aydinliyim & George L. Vairaktarakis, 2010. "Coordination of Outsourced Operations to Minimize Weighted Flow Time and Capacity Booking Costs," Manufacturing & Service Operations Management, INFORMS, vol. 12(2), pages 236-255, January.
    17. Tijs, S.H. & Brânzei, R., 2004. "Cases in Cooperation and Cutting the Cake," Discussion Paper 2004-108, Tilburg University, Center for Economic Research.
    18. Zhao, Jingang, 1999. "A necessary and sufficient condition for the convexity in oligopoly games," Mathematical Social Sciences, Elsevier, vol. 37(2), pages 189-204, March.
    19. Kuipers, Jeroen & Mosquera, Manuel A. & Zarzuelo, José M., 2013. "Sharing costs in highways: A game theoretic approach," European Journal of Operational Research, Elsevier, vol. 228(1), pages 158-168.
    20. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.

    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:spr:mathme:v:80:y:2014:i:3:p:285-305. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.