A branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain-scheduling problem

In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery. n jobs have to be scheduled on a single machine and delivered to k customers for further processing in batches. the objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. in this paper, we present a heuristic algorithm (ha) and a branch and bound (b&b) method for the restricted case, where the tardy jobs are delivered separately, and compare these procedures with an existing dynamic programming (dp) algorithm by computational tests. the results of computational tests show significant improvement of the b&b over the dynamic programming algorithm.