In order to rapidly share manufacturing resources among enterprises in a network environment, reduce carbon emissions and production costs, scheduling of cellular manufacturing with intercell moves is studied. Previous researches on cellular manufacturing with intercell moves either supposed that a part can only move between two cells at most one time or supposed that intercell moves of parts were on fixed paths. However, there might be several manufacturing cells with the same processing function or several same machines in different cells in a network environment. Intercell moves of parts might have flexible routes. To make the cellular manufacturing with intercell moves in a network environment, a scheduling model aiming at minimizing total carbon emissions, makespan and total costs is proposed for intercell moves with flexible routes and no restrictions on the number of intercell moves. An improved artificial bee colony algorithm (ABC) is proposed to solve the scheduling model. In order to improve searching ability of ABC, neighborhood search with an adaptive stepsize mechanism is proposed in leader bee phase and onlooker phase of the algorithm. A binary tournament selection method is designed to improve convergence speed in the onlooker bee phase. A case study is used to verify the proposed model and algorithm. The results show that improved algorithm has better performance on convergence speed and searching ability than that of original artificial bee colony algorithm.