Scheduling for gathering multitype data with local computations

•We consider minimizing the time of gathering multitype data in a star network.•The analyzed problem is NP-hard.•Polynomial-time exact algorithms are proposed for two special cases of the problem.•Exact and approximation algorithms are proposed for the general case.•The performance of the algorithms is analyzed in computational experiments.