1.左右仓入库均匀分配

src/main/java/com/neotel/smfcore/core/system/util/TaskService.java

@@ -892,14 +892,14 @@ public class TaskService {
             throw new ValidateException("smfcore.noValidStorage", "料仓列表中未找到可用的料仓");
             throw new ValidateException("smfcore.noValidStorage", "料仓列表中未找到可用的料仓");
         }
         }
 
 
-        availbleStorageList.sort(new Comparator<Storage>() {
+        /*availbleStorageList.sort(new Comparator<Storage>() {
             @Override
             @Override
             public int compare(Storage o1, Storage o2) {
             public int compare(Storage o1, Storage o2) {
                 Integer taskCount1 = storageTaskCountMap.get(o1.getId());
                 Integer taskCount1 = storageTaskCountMap.get(o1.getId());
                 Integer taskCount2 = storageTaskCountMap.get(o2.getId());
                 Integer taskCount2 = storageTaskCountMap.get(o2.getId());
                 return taskCount1.compareTo(taskCount2);
                 return taskCount1.compareTo(taskCount2);
             }
             }
-        });
+        });*/
 
 
         return findEmptyPosInStorages(barcode, availbleStorageList, storageTaskCountMap, lastPosId);
         return findEmptyPosInStorages(barcode, availbleStorageList, storageTaskCountMap, lastPosId);
     }
     }