problem discussion

[agelospanagiotakis]

Here's a description of my problem:

The customer has various walls of a fixed length, and hes want to efficiently dress them with segments of a material i have in fixed lengths (let's say lengths of a 2 meters and b 3 meters).
I have an unlimited supply of these components, but you I want to count how many of each component are to be used to fill the wall while minimizing waste.

Constraints:

• We care only about the length not the width or any other dimension either for the wall or the components.
• Wall Size: The walls lengths are known to us (e.g., 16 meters and 5 meters).
• Component and Segment Lengths: You have components with fixed lengths (let's say for example a) 2 meters and b) 3 meters). We can cut the a or b to a desired length. Generalise here the Components and their lengths are an input parameter.
• Waste : waste is considered to be the part of the component that is cut and the other part is never used. one part is used to fill the wall and the other is cosidered as discarded/waste.
• Objective: packing the entire walls with components and their segments.
• Objective: You need to keep track of the number of a and b components and their segments used to fill each wall.
• Objective: We must minimize waste while packing.

The goal is to find an arrangement of components and their segmenting on the wall that minimizes the number of segments used and counts how many of each segment length is used in each wall.

Do you think this solver help me solve my problem?