This thesis presents a single-product two-parallel facilities production planning model with capacity constraints in which known requirements have to be satisfied. The model is analyzed in both the nonbacklog and backlog cases. The structure of an optimal solution is characterized and then used in a simple dynamic programming algorithm for problems in which the capacities are same in every period. The algorithm is illustrated with numerical examples.