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

Algorithm 1

Algorithm DP1.

	Step 1. Re-index the jobs in the SPT rule.
	Step 2. Initial conditions: F (0, 0, t, 0) = 0, for t = max {q, r − amax + 1}, …, r.
	Step 3. Recursive equations:
	For t = max {q, r − amax + 1}, …, r, and j = 1, …, n;
	For l = 1 and , 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 4. Optimal solution:
	.