LAUSR

This paper addresses the planning and scheduling problem of a multiproduct multistage continuous plant by three novel MILP-based (mixed integer linear programming) models. These models combine a TSP (traveling salesman problem) formulation with the main ideas of general precedence and unit-specific general precedence concepts to provide hybrid discrete/continuous time representations of the system. Also, an efficient solution approach involving rolling horizon and iterative-improvement algorithm is derived for solving medium-size instances of the problem. Results analyses for different model’s parameters demonstrate the benefits of the new formulations and the effectiveness of the solution approach presented in this work.