In this paper, we present mathematical models for optimal scheduling of non-sequential multipurpose batch processes under various intermediate storage policies. Compared with multiproduct processes, in non-sequential multipurpose batch processes, the production routes of products may be different from one another and may be backward direction. Consequently, in order to reduce idle time of units and to raise the efficiency of process, we have to make operation sequences of products in each unit differently by considering processing route of each product with a given intermediate storage policy. The basic concept of our approach for these problems is as follows. Firstly, we represented the starting and finishing time of a task in each unit with two coordinates for a given storage policy. One is based on products, and the other is based on sequences. Then, we matched the variables used in the two coordinates into one with binary variables and logical constraints. We formulated these problems as MILP(Mixed Integer Linear Programming) models and apply them to three examples to show the effectiveness of the model.