This paper studies both the design and cyclic scheduling of multi-hoist treatment surface facilities. Former research have always assumed that production line is already available with a fixed material handling fleet size. However, in this study, number hoists considered as decision variable problem. The latter then bi-objective called Cyclic Hoist Design Scheduling Problem (CHDSP). optimizatio...

We present a new octree-based neighborhood search method for SPH simulation. A speedup of up to 1.9x is observed in comparison state-of-the-art methods which rely on uniform grids. While our focuses maximizing performance fixed-radius simulations, we show that it can also be used scenarios where the particle support radius not constant thanks adaptive nature octree acceleration structure. Neigh...

The Minimum Coloring Cut Problem is defined as follows: given a connected graph G with colored edges, find an edge cut E′ of G (a minimal set of edges whose removal renders the graph disconnected) such that the number of colors used by the edges in E′ is minimum. In this work, we present two approaches based on Variable Neighborhood Search to solve this problem. Our algorithms are able to find ...