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 Set-Union Knapsack Problem (SUKP) is a complex combinatorial optimization problem that extends the classic Knapsack with each item composed of several distinct weighted elements instead ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results