New Mixed Integer Linear Programming Model for Solving Scheduling Problems with Special Characteristics

fA new mixed integer linear programming (MILP) model suitable for optimizing scheduling problems typical in chemical and related industries is developed. These problems have characteristics like storage time constraints, operational connectivity restrictions, and continuous tasks with special precedence constraints. Therefore, a new MILP model is developed for handling these special scheduling problems. The numerical capability of the model is demonstrated using test problems of different complexity levels.