This is a 1D packing problem that I did some extension to 3D box packing algorithm.
The method incrementally packs all the containers and leaves empty ones without possible solution. I also added the T output to transform custom geometries within boxes. The nesting sequence is the container list sequence.
Also works for scenarios like this:
Since this is the first implementation (at least for your given case it works not tested more), you must specify sheets yourself at your desired positions else boxes will overlap.
I only release this version here, if you want to use it, replace the OpenNest.gha with this one:
OpenNest.zip (183.7 KB)