The　two-dimensional　strip　packing　problem　is　to　pack　a　given　set　of　rectangles　into　a　strip　with　a　given　width　and　infinite　height　so　as　to　minimize　the　required　height　of　the　packing.　From　the　computational　point　of　view,　the　strip　packing　problem　is　an　NP-hard　problem.　With　the　B-tree　representation,　this　paper　first　presents　a　heuristic　packing　strategy　which　evaluates　the　positions　used　by　the　rectangles.　Then　an　effective　local　search　method　is　introduced　to　improve　the　results　and　a　heuristic　algorithm　(HA)　is　further　developed　to　find　a　desirable　solution.　Computational　results　on　randomly　generated　instances　and　popular　test　instances　show　that　the　proposed　method　is　efficient　for　the　strip　packing　problem.　©　2012　Springer　Science+Business　Media,　LLC.