>I am looking for a best FoxPro code to fill in rectangular shale with as many instances of smaller rectangular as possible.
>The real task is: I have a pallet 40” by 48” and need to place on this pallet as many cases 9” by 15” as possible with minimum pallet space waste.
>Of course sizes of a pallet and case will vary.
>Any help will be greatly appreciated.

Not an easy problem to "solve" (a classic "NP Hard" problem http://en.wikipedia.org/wiki/NP-hard). A lot of the papers online are hidden behind pay sites and they're all pretty heavy on the math.

Here's a student paper that (might) help:

http://www.google.com/url?sa=t&source=web&ct=res&cd=4&url=http%3A%2F%2Fwww.mpi-inf.mpg.de%2F~rharren%2Fpublications%2FHarren-StudentResearchPaper.pdf&ei=aZi7SsDFOIrElAfPxpStDQ&rct=j&q=packing+weighted+rectangles+into+a+square&usg=AFQjCNGVGA3VuQrTTTjCV2pRQ8koU20ppw

This one is a little less math heavy and is easier to understand:

http://www.google.com/url?sa=t&source=web&ct=res&cd=6&url=http%3A%2F%2Fwww-rcf.usc.edu%2F~skoenig%2Ficaps%2Ficaps04%2Ficapspapers%2FICAPS04KorfR.pdf&ei=ZZq7SoTTJtX7tgebiYXEDQ&rct=j&q=packing+rectangles+into+a+square+algorithm&usg=AFQjCNEM94cbyNR_irZm10vwUDPp_Hmexg


Try Googling for "packed weighted rectangles" or "packed rectangle algorithms"