This study proposes a heuristic algorithm to
solve master planning problems of a supply chain
network with a single final finished product. The
objective is to minimize the processing and
transportation costs under the constraints of the
capacity limits and the quantity and due date
requirements of all the orders.
