2. One-dimensional cutting stock problem
3. Bin pack problem
4. Multi-threading/GPGPU programming
5. JavaFX programming (Optional)
1. Cutting stock problem
There are groups of orders that have their lengths and required quantities. Group of stocks with different stock lengths and with unlimited quantities. Find the close-to-optimal cutting list that has the least scrap/reserved lengths, least cuts, fastest production time, least order spread. Users can be able to assign discharge compartments for further bar processing.
2. Bin packing problem
According to the machine's discharge compartment configuration, find a cutting list that has the least packing count. How many packaging counts depends on cut products weight and quantity.
14 freelancers estão ofertando em média $2279 nesse trabalho
Hi I have 2 years experience in java programming language. I am master in computer science and willing to do the work. I have studied the algorithm courses as well. Please provide me more details about the work. Best
HI Can you provide a sample order. What is length of main bar from which stocks need to be cut. What is the weight per unit length of the material from which stock is cut. Need to discuss more about the task....
Dear sir I have a lot of experiences in java. I'm an expert in java many algorithms and its data strcuture. I'm sure i can make a good result for you in a short time. Thanks sir Waiting for your reply.