Production transportation scheduling problem with constraints is common in process industry. But it is a NP-hard problem. In this paper, the production transportation scheduling problem between a plant that produces intermediate products and a finishing plant which processes the intermediate products in finished goods is studied. Model formulation and solution method are proposed. Using simulated data from a process industry firm, the computational study shows that schedules yield significant cost.