Algorithms for Picking and Distribution of Online Orders in New Retail Enterprises
Algorithm 2
LGP.
Input: a feasible solution of generated from CA-D with delivery batches of .
Output: an improved feasible solution.
Initialization: .
Step 1: for batch , select two jobs randomly from this batch. Swap the two jobs in the processing sequence, i.e., on each machine, corresponding subjobs are swapped. Compute the completion time of the last job in on the assembly machine. Repeat such swapping operation 50 times and select the processing sequence with the minimum completion time of the last job in .
Step 2: for batch , select two jobs randomly from this batch. Swap the two jobs in the delivery sequence and compute the total delivery time of this new sequence. Repeat such swapping operation 50 times and select the delivery sequence with the minimum total delivery time.
