Being different from the traditional Knapsack algorithm, KFA is for multiple-objective optimization., ...

Aimed at nearly partition problem, partition problem and 0 1 knapsack problem, a new fast algorithm is proposed. The core of ...

Abstract: With increasing complex workflow application and computational resources requirement, distributed computing has attracted growing attention. Meanwhile, cloud computing has emerged as a ...

Abstract: Existing algorithms for the two-stage assembly scheduling problem (TASP) ignores the setup time and depends on four or more fine-tuned parameters. This work focuses on TASPs with separated ...