in reply to
Re^2: Computer science Problem - single dimension bin packing
in thread Computer science Problem - single dimension bin packing
Stuff is left behind.
Then add another bin (tape) and start filling it with leftovers. Repeat until no more bins (tapes) or leftovers.
The first few bins would probably be most optimally filled for most datasets but if the goal is to use the least amount of tapes this should work... or am I missing something?
Time flies when you don't know what you're doing