Scheduling on a Single Machine and Parallel Machines with Batch Deliveries and Potential Disruption

Algorithm 2

Algorithm DP2.

	Step 1. Perform Step 1-2 of Algorithm 1 (DP1).
	Step 2. Recursive equations:
	For t = max{q, r − amax + 1}, …, r, j = 1, …, n;
	For l = 1, i.e., , set and
	For l = 2 to n do
	If and , then set
	When , set
	When , set
	Endif
	If and , then set
	When , set
	When , set
	Endfor
	Endfor
	Step 3. Optimal solution:
	.