Abstract: The Multi-Dimensional Knapsack Problem (MDKP) is a strongly NP-Hard combinatorial optimization problem that extends the Knapsack Problem (KP) to multiple constraints. While effective ...

Abstract: This work investigates the space-limited aircraft assembly scheduling problem (SAASP) based on real-world cases. A computational model, minimizing the makespan, is developed to formulate the ...