Abstract: To deal with the production-distribution network for a manufacture with multiple plants with capacity constraints and multiple retailers, a joint decisions problem with production and transportation capacity constraints is studied. The decision variables include the production cycle length, delivery frequency in a cycle from the warehouse to the retailers and the economic production allocation. The optimization objective is to minimize of the average total cost per unit time. Since this problem is a noncocave-and-nonconvex nonlinear programming, its model is improved. A heuristics is developed to solve this joint decisions model. With a numerical example given to compute the problem of different sizes via either the proposed algorithm or the quasi-Newton method(QNM). The results showed the correctness of the model and the effectiveness of the proposed algorithm.