Task: how to optimally distribute the balances in the warehouse according to orders?

Question

Mathematics

Colleagues, there is a real working problem, help me find a solution. There are n "coils" in stock, each of which is wound with a cable of different lengths. We have m requests for the purchase of a cable, also with different lengths. It is necessary to find the optimal combination of applications and coils in order to satisfy the maximum (not necessarily all) number of applications. In this case, the application is considered closed only if the cable of the required length is supplied in full, in one indivisible segment. For example, if we have two coils of 15m and 20m each and an application for 21m, then it will not be possible to satisfy it, because we will not be able to supply an indivisible segment of 21m.
In reality, there can be several hundreds of coils and orders, and the algorithm must work out in a reasonable time.
The programming language is not fundamental, you can just pseudocode. Any links to specials are welcome. literature covering such algorithms.

Answer 1

Container packing problem , one-dimensional packing problem .