Platform　resource　scheduling　is　an　operational　research　optimization　problem　of　matching　tasks　and　platform　resources,　which　has　important　applications　in　production　or　marketing　arrangement　layout,　combat　task　planning,　etc.　The　existing　algorithms　are　inflexible　in　task　planning　sequence　and　have　poor　stability.　Aiming　at　this　defect,　the　branch-and-bound　algorithm　is　combined　with　the　genetic　algorithm　in　this　paper.　Branch-and-bound　algorithm　can　adaptively　adjust　the　next　task　to　be　planned　and　calculate　a　variety　of　feasible　task　planning　sequences.　Genetic　algorithm　is　used　to　assign　a　platform　combination　to　the　selected　task.　Besides,　we　put　forward　a　new　lower　bound　calculation　method　and　pruning　rule.　On　the　basis　of　the　processing　time　of　the　direct　successor　tasks,　the　influence　of　the　resource　requirements　of　tasks　on　the　priority　of　tasks　is　considered.　Numerical　experiments　show　that　the　proposed　algorithm　has　good　performance　in　platform　resource　scheduling　problem.　©　2023,　The　Author(s),　under　exclusive　licence　to　Springer-Verlag　GmbH　Germany,　part　of　Springer　Nature.