จนกระทั่งถึงเวลาสอบเข้ามหาลัย

จนกระทั่งถึงเวลาสอบเข้ามหาลัย

Results (English) 1:

Until the time of the college entrance examination

Results (English) 2:

Shifting algorithm
The shifting algorithm is the improvement heuristic attempting to
insert a task to an agent in order to generate better solution. Suppose
task i is currently assigned to agent j. In the shifting algorithm, task
i will be shifted to agent j
’ that has lower cost than that of agent j.
For example, currently task 5 is assigned to agent 1 (cost is 24 units).
The algorithm will shift task 5 to agent 2 since agent 2 yields lower
assignment cost (i.e., 17 units). However, the capacity of agent 2 must
be enough to add task 5 as its client. An example of the shifting algorithm is shown in Fig. 3. Fig. 3(a) shows the result of the assigning
procedure when there are 5 tasks and three agents. Tasks 1, 2, 3, 4
and 5 are assigned to agent 1, 2, 3, 3, and 1, respectively. After applying the shifting procedure as explained above, task 5 will be shifted
to agent 2 instead of agent 1 as shown in Fig. 3(b). It is noted that, in
the shifting algorithm, the re-assignment will be done according to
order .

Results (English) 3:

Until the end.