IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_56.html
   My bibliography  Save this book chapter

Scheduling in a Data Gathering Network to Minimize Maximum Lateness

In: Operations Research Proceedings 2018

Author

Listed:
  • Joanna Berlińska

    (Adam Mickiewicz University in Poznań)

Abstract

In this work, we study scheduling in a data gathering network comprising a set of workers and a single base station. The workers produce datasets that have to be sent to the base station for further processing. Each dataset can be released at a different moment, and is assigned a due date by which it should be processed. Our goal is to schedule dataset transfers and the base station computations so as to minimize the maximum dataset lateness. We prove that the analyzed problem is strongly NP-hard, and present several polynomially solvable special cases. An exact branch-and-bound algorithm and three greedy heuristics are proposed. The performance of the algorithms is tested in computational experiments.

Suggested Citation

  • Joanna Berlińska, 2019. "Scheduling in a Data Gathering Network to Minimize Maximum Lateness," Operations Research Proceedings, in: Bernard Fortz & Martine Labbé (ed.), Operations Research Proceedings 2018, pages 453-458, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_56
    DOI: 10.1007/978-3-030-18500-8_56
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:oprchp:978-3-030-18500-8_56. 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: 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.