An efficient decomposition method to solve the integrated problem of scheduling and dynamic optimization for sequential batch processes is proposed. The integrated problem is formulated as a mixed-integer dynamic optimization problem or a large-scale mixed-integer nonlinear programming (MINLP) problem by discretizing the dynamic models. To reduce the computational complexity, we first decompose all dynamic models from the integrated problem, which is then approximated by a scheduling problem based on the flexible recipe. The recipe candidates are expressed by Pareto frontiers, which are determined offline by using multiobjective dynamic optimization to minimize the processing cost and processing time. The operational recipe is then optimized simultaneously with the scheduling decisions online. Because the dynamic models are encapsulated by the Pareto frontiers, the online problem is a mixed-integer programming problem which is much more computationally efficient than the original MINLP problem, and allows the online implementation to deal with uncertainties. (c) 2013 American Institute of Chemical Engineers AIChE J, 59: 2379-2406, 2013