We develop a polynomial-time algorithm for solving a class of 0-1 production-transportation problems. The objective function is the maximum of $n$ monotonic functions of the production volume. The transportation cost is assumed to be small as compared to the production cost and is omitted. The proposed algorithm is based on a labeling technique for improving feasible solutions.