自动化立体仓库 - WMS系统
Junjie
2023-12-06 828b592b5f8e31204f93bcc2ea0c5866bdc0dcf0
src/main/java/com/zy/common/service/CommonService.java
@@ -413,36 +413,45 @@
            if(!VersionUtils.checkLocType(locMast0,locTypeDto)){
                continue;
            }
            //单品物料
            if (matNos.size() == 1) {
                //单品物料
                //如果不是深浅,则直接返回当前库位
                if(Cools.isEmpty(Utils.getGroupDeepLoc(locMast0.getLocNo()))){
                    return locMast0;
                }else{
                    List<String> groupInnerLoc = Utils.getGroupInnerLoc(locMast0.getLocNo());
                    //如果是深浅库位,但是内测无库位的情况下,则直接返回当前库位
                    if (Cools.isEmpty(groupInnerLoc)) {
                        return locMast0;
                    }else {
                        //获取最深的库位
                        String loc = groupInnerLoc.get(groupInnerLoc.size() - 1);
                        LocMast locMast1 = locMastService.selectByLoc(loc);
                        //如果最深测库位为空库位,则直接返回最深库位
                        if("O".equals(locMast1.getLocSts())){
                            return locMast1;
                        }else {
                            //如果最深库位状态不为F或者O,则跳出当前的深浅库位查找
                            if(!"F".equals(locMast1.getLocSts())){
                                continue;
                            }
                            List<LocDetl> locDetls = locDetlService.selectByLocNo(loc);
                            //如果当前深库位物料与入库物料不相符,则跳出当前深浅库位查找
                            if(!Cools.eq(locDetls.get(0).getMatnr(),matNos.get(0))){
                                continue;
                            }
                            //从里往外依次遍历该组深浅库位
                            for (int i=groupInnerLoc.size()-1; i>=0 ;i--){
                                LocMast locMast2 = locMastService.selectByLoc(groupInnerLoc.get(i));
                                if("O".equals(locMast2.getLocSts())){
                                    //如果深库位中含有0状态的库位,则直接返回该库位
                                    return locMast2;
                                }else if("F".equals(locMast2.getLocSts())){
                                    //如果对于locaMast0最近的一个库位也为F状态,则返回locaMastO
                                    if(i==0){
                                        return locMast1;
                                        return locMast0;
                                    }else {
                                        //如果该组深浅库位中含有既不为F也不为O的库位,则跳出当前深浅库位查找
                                        continue;
                                    }
                                }else {