Manufacture and delivery scheduling for customers on one manufacturing machine with an availability constraint

Abstract

Abstract We consider a scheduling problem with the joint consideration of manufacture and delivery for m customers in different locations. In the manufacture period, there must be some interrupted job because of the arranged maintenance of the machine, and that job can be resumable when the machine becomes available again. In the delivery period, amounts of vehicles without limits of load capacity deliver completed jobs belonging to the same customer to customers in batches. The cost of each delivery is proportional to the distance between the customer and the manufacturer. Our goal is to minimize the sum of total departure time and total delivery cost. The problem is solved optimally by a dynamic programming algorithm with polynomial time O(m 2 n 4), where n is the number of all jobs.