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

Algorithm 4

Algorithm DP4.

	Step 1. Re-index the jobs in the SPT rule.
	Step 2. Initial conditions: F (0, 0, 0, 0, 0, 0, 0, 0) = 0.
	Step 3. Recursive equations:
	For j = 1, …, n; u1 = 0, 1, …, r; u2 = 0, 1, …, min{Aj − u1, r}; ;  = ; q1 = max {u1, r − amax + 1},…, r; q2 = max{u2, r − amax + 1},…, r.
	For l = 1 and , then
	For l = 2 to n do,
	schedule job Jj before r on machine M2
	If and , then set and
	If and , then set and
	schedule job Jj before r on machine M2
	If and , then set and ,
	If and , then set and
	Endif
	schedule job Jj to be finished after r on machine M1
	If and , then set and
	If and , then set and
	Endif
	schedule job Jj to be finished after r on machine M2
	If and , then set and
	If and , then set and
	Endfor
	Endfor
	Step 4. Optimal solution:
	.