in reply to Tricky chemicals optimization problem
and only the same flavor nozzles can be consolidated as long as the capacity of the machine allows for it on that day
Can you explain that further?
I can't decide which interpretation is correct?
This means I have the volume used per nozzle-flavor-machine combination.
I realise you've said this is an analogy, but can you adapt some of your real-world chemicals data to that analogy and give us something to play with? It doesn't need to be (shouldn't be) a huge volume of data; the key is that you should be able to also supply your desired output. That means you need to show a set of input data, and a corresponding, good (even if not optimal), set of outputs.
On first blush this sounds like a variation on the Knapsack problem which is NP-hard, but many variations of that can be "solved" economically given sufficient domain-specific knowledge and insights.
In essence, I'm saying tell us more about the problem, and give us something real to work on and test our solutions against.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Tricky chemicals optimization problem
by Anonymous Monk on Jan 10, 2017 at 00:58 UTC | |
by BrowserUk (Patriarch) on Jan 10, 2017 at 10:35 UTC | |
by Anonymous Monk on Jan 10, 2017 at 13:50 UTC | |
by Anonymous Monk on Jan 10, 2017 at 13:52 UTC | |
by haukex (Archbishop) on Jan 10, 2017 at 14:15 UTC | |
by LanX (Saint) on Jan 10, 2017 at 15:24 UTC | |
| |
by BrowserUk (Patriarch) on Jan 10, 2017 at 15:08 UTC | |
by BrowserUk (Patriarch) on Jan 10, 2017 at 22:10 UTC | |
|