IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v256y2017i3p713-728.html
   My bibliography  Save this article

Modeling elements and solving techniques for the data dissemination problem

Author

Listed:
  • Bocquillon, Ronan
  • Jouglet, Antoine

Abstract

Systems of Systems (SoS) are collections of non-homogeneous, independent systems that interact to provide services. These systems can opportunistically share data during contacts that arise whenever two entities are close enough to each other. It is assumed in this paper that all contacts can be reliably predicted, i.e. the mobility of every system can be reliably estimated. A datum is split into several identified datum units to be delivered to a subset of recipient systems. During a contact, a given emitting system can transmit to a given receiving system one of the datum units that it possesses. The dissemination problem consists in finding a transfer plan which enables all the datum units to be transmitted from the sources (the systems that possess datum units from the beginning) to all the recipient systems. In this paper, we propose dominance-rule-based techniques for solving the data dissemination problem. In particular, we describe preprocessing procedures and some integer-linear-programming formulations to solve the problem.

Suggested Citation

  • Bocquillon, Ronan & Jouglet, Antoine, 2017. "Modeling elements and solving techniques for the data dissemination problem," European Journal of Operational Research, Elsevier, vol. 256(3), pages 713-728.
    • Handle: RePEc:eee:ejores:v:256:y:2017:i:3:p:713-728
    DOI: 10.1016/j.ejor.2016.07.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716305501
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.07.013?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. Jouglet, Antoine & Carlier, Jacques, 2011. "Dominance rules in combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 212(3), pages 433-444, August.
    2. Bocquillon, Ronan & Jouglet, Antoine & Carlier, Jacques, 2015. "The data transfer problem in a system of systems," European Journal of Operational Research, Elsevier, vol. 244(2), pages 392-403.
    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. Silva, Marco & Poss, Michael & Maculan, Nelson, 2020. "Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 283(1), pages 70-82.
    2. Rasti-Barzoki, Morteza & Hejazi, Seyed Reza, 2013. "Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains," European Journal of Operational Research, Elsevier, vol. 228(2), pages 345-357.
    3. Braune, R. & Zäpfel, G. & Affenzeller, M., 2012. "An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 218(1), pages 76-85.
    4. Jacques Carlier & Antoine Jouglet & Eric Pinson & Abderrahim Sahli, 2022. "A data structure for efficiently managing a set of energy functions," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2460-2481, November.
    5. Nasini, Stefano & Nessah, Rabia, 2022. "A multi-machine scheduling solution for homogeneous processing: Asymptotic approximation and applications," International Journal of Production Economics, Elsevier, vol. 251(C).
    6. Falq, Anne-Elisabeth & Fouilhoux, Pierre & Kedad-Sidhoum, Safia, 2022. "Dominance inequalities for scheduling around an unrestrictive common due date," European Journal of Operational Research, Elsevier, vol. 296(2), pages 453-464.
    7. Ponboon, Sattrawut & Qureshi, Ali Gul & Taniguchi, Eiichi, 2016. "Branch-and-price algorithm for the location-routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 1-19.
    8. Rico Walter & Alexander Lawrinenko, 2020. "A characterization of optimal multiprocessor schedules and new dominance rules," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 876-900, November.

    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:eee:ejores:v:256:y:2017:i:3:p:713-728. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.