Scheduling Data Gathering with Maximum Lateness Objective

Berlińska, Joanna

doi:10.1007/978-3-319-78054-2_13

Cited by 6 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Algorithms minimizing data gathering time were proposed for networks with data compression (Berlińska 2015;Luo et al 2018a, b) and networks with limited base station memory (Berlińska 2020). Minimizing the maximum dataset lateness was studied by Berlińska (2018a). All the above works share a common assumption that the network performance is constant.…”

Section: Introductionmentioning

confidence: 99%

Scheduling in data gathering networks with background communications

Berlińska

2020

J Sched

Self Cite

View full text Add to dashboard Cite

In this work, we study scheduling in star data gathering networks with background communications. The worker nodes of the network hold datasets that have to be transferred directly to the base station. The communication speed of each link changes with time, due to other applications using the network, independently of the speeds of other links. Our goal is to gather all data within the minimum time. We show that while the preemptive version of this problem can be solved in polynomial time, the non-preemptive variant is strongly NP-hard. We propose for it an exact exponential algorithm based on dynamic programming, several polynomial time heuristics and local search algorithms. Theoretical performance guarantees and the existence of dominance relations between the heuristics are studied. The performance of the proposed algorithms is also tested in a series of computational experiments.

show abstract

Section: Introductionmentioning

confidence: 99%

Scheduling in data gathering networks with background communications

Berlińska

2020

J Sched

Self Cite

View full text Add to dashboard Cite

show abstract

“…Later on, scheduling algorithms for networks with fixed sizes of data gathered by individual nodes were proposed. The analyzed objectives included maximizing the network lifetime (Berlińska 2014), minimizing the time of data gathering (Berlińska 2015;Luo et al 2018a, b), and minimizing the maximum lateness (Berlińska 2018a).…”

Section: Introductionmentioning

confidence: 99%

Heuristics for scheduling data gathering with limited base station memory

Berlińska

2019

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

In this paper, we analyze scheduling in data gathering networks with limited base station memory. The network nodes hold datasets that have to be gathered and processed by a single base station. A dataset transfer can only start if sufficient amount of memory is available at the base station. As soon as a node starts sending a dataset, the base station allocates a block of memory of corresponding size. The memory is released when computations on the dataset finish. We prove that minimizing the total data gathering and processing time is strongly NP-hard. As this problem is a special case of a specific resource constrained flow shop scheduling problem, for which an exact exponential algorithm is known, we propose several simple polynomial-time heuristics and two groups of local search algorithms, and test their performance in computational experiments. We show that the local search algorithms produce very good schedules, and one of the simple heuristics delivers solutions of comparable quality in a very short time.

show abstract

Scheduling in a Data Gathering Network to Minimize Maximum Lateness

Berlińska

2019

Operations Research Proceedings

View full text Add to dashboard Cite

Scheduling Data Gathering with Maximum Lateness Objective

Cited by 6 publications

References 23 publications

Scheduling in data gathering networks with background communications

Scheduling in data gathering networks with background communications

Heuristics for scheduling data gathering with limited base station memory

Scheduling in a Data Gathering Network to Minimize Maximum Lateness

Contact Info

Product

Resources

About