The problem of evaluating the mean service cycle time in fork-join queueing networks is considered. An approach is proposed based on implementation and further development of the methods of idempotent algebra. It is shown that for acyclic networks under sufficiently general conditions the mean cycle time is determined by mean service time at the network nodes only and it is independent of network topology.