Scheduling for data gathering networks with data compression
From MaRDI portal
Publication:319855
DOI10.1016/J.EJOR.2015.05.026zbMath1346.90325OpenAlexW1891704960WikidataQ111522130 ScholiaQ111522130MaRDI QIDQ319855
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.026
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (6)
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements ⋮ A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks ⋮ Scheduling in data gathering networks with background communications ⋮ Scheduling for gathering multitype data with local computations ⋮ Algorithms for communication scheduling in data gathering network with data compression ⋮ Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments
Cites Work
This page was built for publication: Scheduling for data gathering networks with data compression