Abstract: Heuristic dispatching rules (HDRs) are widely used for solving the dynamic fuzzy job shop scheduling problem. However, their performance is highly sensitive to specific scenarios and often ...
Abstract: The traveling salesman problem (TSP) is a classic problem in computer science and operations research which involves finding the shortest possible route that visits a given set of cities. In ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results