A Makespan Optimization Scheme for NP-Hard Gari Processing Job Scheduling Using Improved Genetic Algorithm

Algorithm 2

Shortest processing time (SPT) algorithm for 𝑛 jobs, 𝑚 processes.

Step  0. Read 𝑃_𝑖𝑗 = the  set  of  processing  job  times  for  the  𝑗th  process

and {𝐽_𝑖} = the  corresponding  set  of  job  numbers1≤𝑗≤𝑚,(1≤𝑖≤𝑛)

Step  1. Set 𝑖=2, 𝑗=𝑘=0

Step  2. Set 𝑗=𝑗+1

Step  3. Set 𝑘=𝑘+1

Step  4. If 𝐼𝑓𝑃_𝑘𝑗>𝑃_𝑖𝑗 GO TO Step  5

Else Set 𝑉=𝑃_𝑘𝑗 and 𝑅=𝐽_𝑘, the  corresponding  job

 Set 𝑃_𝑘𝑗=𝑃_𝑖𝑗 and 𝐽_𝑘=𝐽_𝑖

 Then set 𝑃_𝑖𝑗=𝑉 and 𝐽_𝑖=𝑅

Step  5. 𝐈𝐟𝑘<𝑛, GO  TO𝑆𝑡𝑒𝑝3

Else GO  TO 𝑆𝑡𝑒𝑝6

Step  6. Set 𝑘=0

If   𝑗<𝑚, GO TO Step  2

ELSE STOP