INEH-VNS Algorithm Solved Automatic Production System Scheduling Problem under Just-in-Time Environment
Algorithm 1
The pseudocode of the INEH-VNS.
Algorithm INEH-VNS
Input: processing time of job, the time of robotic activity, the time of void move, the number of jobs , the number of tanks , the due date of job, the time of void move, neighborhood structures, (Adjacent exchange), (Random insertion), and (Job exchange). Let .
Output: optimal solution , and optimal objective value .
//First stage: generate initiation solution by INEH.
For=0 to
For =0 to
Record the amend processing time of job as
End for
End for
For=0 to
For =0 to
Calculate the sum of processing time of each job in all tanks as
End for
End for
For=0 to
For =0 to
Descending order , obtain the job sequence set .
End for
End for
For=0 to
For = to
According to property 1, initiation solution is obtained.
End for
End for
The double procedure method is proposed, the objective value is computed. Let and .
