An efficient and faithful Python implementation of the Bounded Multi-Source Shortest Path (BMSSP) algorithm, along with baselines using pure-Python Dijkstra and SciPy-accelerated Dijkstra. This ...
Abstract: In discrete manufacturing systems, the concurrent production of customized orders increases the complexity of multi-order remaining completion time (MORCT) prediction. Most existing methods ...
Abstract: In this study, we proposed a new method combining graph sampling aggregation network (GraphSAGE), Contrastive Learning (CL) and Bayesian Optimization. First, GraphSAGE was used to model the ...
There was an error while loading. Please reload this page.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results