(the objective can also be seen as maximizing minimal bin idle time)
Hello Nodari,
As I discussed in my work, there is no "the best optimization algorithm". However, we can try different algorithms and compare their performance. In my case study, COA and ICA algorithms were the most efficient algorithms in many aspects.
Go through this paper and you will understand better:
"Using cuckoo optimization algorithm and imperialist competitive algorithm to solve inverse kinematics problem for numerical control of robotic manipulators"
This problem sounds the same as scheduling on uniform parallel machines that has a PTAS.
Hi Mostafa, Apparently, Lowest Fit Decreasing heuristic gives ratio 8/7, and I don't' know if there is something better known. The same bound may hold for different bin capacities as maximizing minimal bin idle space seems to be the same. There should exist PTAS as this is the identical machine problem minimizing makespan, as Noam has noted. I will have a look on your paper (though now the worst-case behavior is what interests me).
- Badges
- Science topic
- Similar topics
- Theoretical Physics
- Time