Browsing index pages (4 articles)
↧
Image may be NSFW.
Clik here to view.
Clik here to view.
Problem Clustering and Suggestions for Solving it (Job-Shop?)
I am trying to find the amount that an item may get produced. To produce this item I need casting-molds. A casting-mold can be used multiple times after it becomes available again.For the production I...
View ArticleAnswer by prubin for Problem Clustering and Suggestions for Solving it...
I gather that you are assuming an unlimited demand for castings. Let $n$ be the number of molds, $p$ be the prep time for each mold (assumed the same for all molds) and $u$ the use time for a prepped...
View ArticleAnswer by Eugen for Problem Clustering and Suggestions for Solving it...
You can use the Graph method of Maximum-Flow-Network to get an optimal solution.
View ArticleAnswer by Georgios for Problem Clustering and Suggestions for Solving it...
So I wrote a simple discrete algorithm, that delivers the solution.I have not found any bugs yet. I will make a few more tests and post whether the code is eligible.Caution!: I used $u = 35$ and not...
View Article
Browsing index pages (4 articles)
![ONEW – KAKERA -Unmei no Piece- – EP [iTunes Plus M4A]](http://is1-ssl.mzstatic.com/image/thumb/Music221/v4/d0/fb/86/d0fb86a5-ba60-4bea-41fb-7f54c125f518/VEATP-45908.jpg/296x296bb.webp)
/pic9814888.png)
