Optimization Of Single Supply Chain Scheduling Problem In Delivery Window

This paper mainly addresses a batch delivery single-machine scheduling problem in which jobs have an assignable common due window which is a varible needed to determined. Each job will incur an early(tardy) penalty if it is early(tardy) with respect to the common due window under a given schedule. A job will incur a holding cost if its completion time is earlier than its dispatch date. There is no capacity limit on each delivery batch, and the cost per batch delivery is fixed ??0? and independent of the number of jobs in the batch. The objective is to find the optimal size and location of the window, the optimal dispatch date for each job, as well as an optimal job sequence to minimize a cost function based on earliness,tardiness,holding time,window location, window size, and batch delivery.The first chapter firstly proposes some notions based on the scheduling problem, then introduces the development of the problem related to our problem. Lastly, We summary the main work of this paper.In the second chapter, we consider the case where the unit cost of earliness? is not more than the unit cost of holding time ?, and the unit cost of holding time? is not more than the unit cost of tardiness ?, even the cost per batch delivery is less than the value of(? ??)multiply by the minimum processing time of jobs. We provide an8O(n) dynamic programming algorithm for this problem.(n is the number of jobs)In the last chapter, we consider the case where the unit cost of tardiness ? is not more than the unit cost of holding time ?, and the unit cost of holding time ? is not more than the unit cost of earliness ?. We provide an8O(n) dynamic programming algorithm for this problem.(n is the number of jobs)...