Scheduling in a Data Gathering Network to Minimize Maximum Lateness

Joanna Berlińska ()
Additional contact information
Joanna Berlińska: Adam Mickiewicz University in Poznań

A chapter in Operations Research Proceedings 2018, 2019, pp 453-458 from Springer

Abstract: 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.

Keywords: Scheduling; Data gathering network; Maximum lateness; Release times; Flow shop (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-030-18500-8_56

Ordering information: This item can be ordered from
http://www.springer.com/9783030185008

DOI: 10.1007/978-3-030-18500-8_56

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().