Cutting Stock Problem - minimize waste and maximize production speed in the steel bar cutting industry.
The program needs to generate an optimal cutting table to tell machine operator how to cut those stocks, where to put them, when to empty them, and when each order is completed.
1. Find all possible combinations and permutations of all progressives within each and every stock lengths with repetition not exceeding the progressives’ quantities, with adjusting progressives’ lengths within maxhead bound and maxtail bond, with reserve lengths, and store them in pattern stacks
2. Find all ways to reduce all progressives’ quantities to 0 using patterns within machine’s limitations and minimum reserve length and store them as cutting tables
3. Choose an optimal solution which has the least pattern used, least reserved lengths and quantities, and least scrap.
32 freelancers are bidding on average $1932 for this job
Hi, This is Paul Devanesn has done [login to view URL] and [login to view URL] from IIT Madras. I am a tech savvy person, more than a decade I am developing and delivering applications on Java based technologies. I am a certified Java profess More
Hello Having experience of java, I can do what you want. Java is my primary programming language. Let us discuss details in chat. Relevant Skills and Experience java Proposed Milestones $2000 USD - 30 days