Research Article
A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks
Data: , | , | Result: | 1 begin | 2 Set | | 3 move into | 4 while then | 5 find | 6 find | 7 if | 8 if exists | 9 for each | 10 start case () | 11 Case 1 is feasible and is feasible | 12 if | 13 | 14 | 15 end if (line 12) | 16 if | 17 | 18 | 19 end if (line 16) | 20 Case 2 is feasible and is infeasible | 21 if | 22 | 23 | 24 end if (line 21) | 25 if | 26 | 27 | 28 end if (line 25) | 29 Case 3 is infeasible and is feasible | 30 if | 31 | 32 | 33 end if (line 30) | 34 if | 35 | 36 | 37 end if (line 34) | 38 end case (line 10) | 39 end (line 9) | 40 end if (line 8) | 41 else (line 7) | 42 if exists | 43 for each | 44 if is feasible and | 45 | 46 | 47 end if (line 44) | 48 if is feasible and | 49 | 50 | 51 end if (line 48) | 52 end (line 43) | 53 end if (line 42) | 54 if exists | 55 for each | 56 if is feasible and | 57 | 58 | 59 end if (line 56) | 60 if is feasible and | 61 | 62 | 63 end if (line 60) | 64 end (line 55) | 65 end if (line 54) | 66 end if (line 7) | 67 Remove from and from | 68 End (line 4) | 69 return and | 70 end |
|