Optimization for Due-Window Assignment Scheduling with Position-Dependent Weights

Algorithm 2

	Step 1: solve assignment problem (11) to obtain the optimal sequence
	Step 2: calculate the completion time of each job under the optimal sequence, and determine the optimal due-window locations and for each job according to Lemmas 2 and 3
	Step 3: obtain the optimal due-window size by setting (), and calculate the objective function by assignment problem (11)