Maurice Frank

Board cutting arrangement

Give a list of boards and a list of parts. The algorithm will try to find a cutting pattern that allows to cut all parts from the boards. This is a 1-D problem, so all boards and parts are assumed to have the same width.