Makespan Minimization in Data Gathering Networks with Dataset Release Times

  • Joanna BerlińskaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12044)


In this work, we analyze scheduling in a star data gathering network. Each worker node produces a dataset of known size at a possibly different time. The datasets have to be passed to the base station for further processing. A dataset can be transferred in many separate pieces, but each sent message incurs additional time overhead. The scheduling problem is to organize the communication in the network so that the total time of data gathering and processing is as short as possible. We show that this problem is strongly NP-hard, and propose a polynomial-time 2-approximation algorithm for solving it. Computational experiments show that the algorithm delivers high quality solutions.


Scheduling Data gathering networks Release times Flow shop Preemption penalties 



This research was partially supported by the National Science Centre, Poland, grant 2016/23/D/ST6/00410.


  1. 1.
    Berlińska, J.: Communication scheduling in data gathering networks with limited memory. Appl. Math. Comput. 235, 530–537 (2014). Scholar
  2. 2.
    Berlińska, J.: Scheduling for data gathering networks with data compression. Eur. J. Oper. Res. 246, 744–749 (2015). Scholar
  3. 3.
    Berlińska, J.: Scheduling data gathering with maximum lateness objective. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds.) PPAM 2017. LNCS, vol. 10778, pp. 135–144. Springer, Cham (2018). Scholar
  4. 4.
    Berlińska, J.: Scheduling in a data gathering network to minimize maximum lateness. In: Fortz, B., Labbé, M. (eds.) Operations Research Proceedings 2018. ORP, pp. 453–458. Springer, Cham (2019). Scholar
  5. 5.
    Berlinska, J.: Heuristics for scheduling data gathering with limited base station memory. Ann. Oper. Res. 285, 149–159 (2020). Scholar
  6. 6.
    Cheng, J., Steiner, G., Stephenson, P.: A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. Eur. J. Oper. Res. 130, 559–575 (2001). Scholar
  7. 7.
    Cho, Y., Sahni, S.: Preemptive scheduling of independent jobs with release and due times on open, flow and job shops. Oper. Res. 29, 511–522 (1981). Scholar
  8. 8.
    Choi, K., Robertazzi, T.G.: Divisible load scheduling in wireless sensor networks with information utility. In: IEEE International Performance Computing and Communications Conference 2008: IPCCC 2008, pp. 9–17 (2008).
  9. 9.
    Horn, W.A.: Some simple scheduling algorithms. Nav. Res. Logist. Q. 21, 177–185 (1974). Scholar
  10. 10.
    Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logist. Q. 1, 61–68 (1954). Scholar
  11. 11.
    Kalczynski, P.J., Kamburowski, J.: An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times. Comput. Oper. Res. 39, 2659–2665 (2012). Scholar
  12. 12.
    Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discret. Math. 1, 343–362 (1977). Scholar
  13. 13.
    Liu, Z., Cheng, T.C.E.: Scheduling with job release dates, delivery times and preemption penalties. Inf. Process. Lett. 82, 107–111 (2002). Scholar
  14. 14.
    Liu, Z., Cheng, T.C.E.: Minimizing total completion time subject to job release dates and preemption penalties. J. Sched. 7, 313–327 (2004). Scholar
  15. 15.
    Luo, W., Xu, Y., Gu, B., Tong, W., Goebel, R., Lin, G.: Algorithms for communication scheduling in data gathering network with data compression. Algorithmica 80(11), 3158–3176 (2018). Scholar
  16. 16.
    Luo, W., Gu, B., Lin, G.: Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments. Eur. J. Oper. Res. 271, 462–473 (2018). Scholar
  17. 17.
    Moges, M., Robertazzi, T.G.: Wireless sensor networks: scheduling for measurement and data reporting. IEEE Trans. Aerosp. Electron. Syst. 42, 327–340 (2006). Scholar
  18. 18.
    Potts, C.N.: Analysis of heuristics for two-machine flow-shop sequencing subject to release dates. Math. Oper. Res. 10, 576–584 (1985). Scholar
  19. 19.
    Schuurman, P., Woeginger, G.J.: Preemptive scheduling with job-dependent setup times. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 759–767 (1999)Google Scholar
  20. 20.
    Tadei, R., Gupta, J.N.D., Della Croce, F., Cortesi, M.: Minimising makespan in the two-machine flow-shop with release times. J. Oper. Res. Soc. 49, 77–85 (1998). Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Faculty of Mathematics and Computer ScienceAdam Mickiewicz UniversityPoznańPoland

Personalised recommendations