| | |
| | | // 入成品库摆放规则 判断可用堆垛机自动-无报警 按层列排顺序从下往上,从前往后排 先深库位在浅库位 最上面一层只能放208L桶(剩余库位达到一个阈值208L就先从最上面开始放,下面留给其他货物-后续优化) |
| | | |
| | | List<BasCrnp> basCrnps = basCrnpService.selectList(new EntityWrapper<BasCrnp>().eq("crn_sts", 3).eq("crn_err", 0).in("crn_no",1,2,3) |
| | | .eq("in_enable","Y").orderBy("crn_no",false)); |
| | | .eq("in_enable","Y")); |
| | | if (basCrnps.size() == 0) { |
| | | log.error("入库请求库位失败,没有联机堆垛机或堆垛机异常"); |
| | | throw new CoolException("入库请求库位失败,没有联机堆垛机或堆垛机异常"); |
| | |
| | | basCrnpList.add(basCrnp); |
| | | } |
| | | |
| | | basCrnpList = basCrnpList.stream().sorted(Comparator.comparing(BasCrnp::getWrkNo)).collect(Collectors.toList()); |
| | | basCrnpList = basCrnpList.stream().sorted(Comparator.comparing(BasCrnp::getWrkNo).thenComparing(BasCrnp::getCrnNo,((o1, o2) -> { |
| | | // 定义 2 → 3 → 1 的优先级 |
| | | int order1 = getCustomOrder(o1); |
| | | int order2 = getCustomOrder(o2); |
| | | return Integer.compare(order1, order2); |
| | | }))).collect(Collectors.toList()); |
| | | |
| | | // 入库桶型 |
| | | String model = findLocNoAttributeVo.getModel(); |
| | |
| | | return startupDto; |
| | | } |
| | | |
| | | // 辅助方法:定义 crn_no 的排序优先级 |
| | | private static int getCustomOrder(Integer crnNo) { |
| | | switch (crnNo) { |
| | | case 2: return 1; // 2 排第一 |
| | | case 3: return 2; // 3 排第二 |
| | | case 1: return 3; // 1 排第三 |
| | | default: return 4; // 其他值排最后(如果有) |
| | | } |
| | | } |
| | | |
| | | @Transactional(propagation = Propagation.REQUIRED) |
| | | public StartupDto getLocNo(SearchLocParam param, Integer staNo) { |
| | | |