Aiming at finding a better way to solve the problem of beer production scheduling, a new collaborative optimization based on the Manhattan Distance and Chameleon Swarm Algorithm is proposed. Firstly, a dynamic relaxation factor is introduced to the constraints at the system level, which combines the changing trend of the inconsistency information and the optimal solution of the discipline level. Additionally, the Manhattan Distance is used to replace the square of the Euclidean Distance at the system level. Thirdly, the Chameleon Swarm Algorithm is used to improve the update rule during the process of iteration. As these improvements are applied to the collaborative optimization, the steps of this new algorithm are given. Through the test case of a multivariate function, it can be found that the algorithm has been improved compared to the original algorithm. Then, a model for beer production scheduling is proposed, and the results of the optimization show that the improved collaborative optimization has better optima effectiveness and fewer iterations and is not sensitive to initial points, which proves that the improved collaborative optimization has a better ability to solve the problem of beer production scheduling than normal collaborative optimization and collaborative optimization with fixed relaxation factors.