This paper provides mathematical programming based optimization model and computational results for short-term scheduling of displacement batch digesters in a pulp industry. The scheduling problem involves development of an optimal solution that yields the best sequence of operations in each of the parallel batch digesters sharing common resources. The constraints are imposed on meeting the demand of pulp of different qualities within a specified time horizon. The problem comprises of both fixed-time and variable time durations of the tasks, different storage policies, zero-wait and finite wait times, and handling of shared resources. The scheduling problem is formulated using a state-task-network (STN) representation of production recipes, based on discrete time representation resulting in a mixed-integer linear programming (MILP) problem which is solved using GAMS software. The basic framework is adapted from the discrete-time model of Kondili et al. (Comput. Chem. Eng., 1993, 17, 211-227). Different case studies involving parallel digesters in multiple production lines are considered to demonstrate the effectiveness of the proposed formulation using two different objective functions. (C) 2013 The Institution of Chemical Engineers. Published by Elsevier B.V. All rights reserved.