Search
Now showing items 1-2 of 2
Grey wolf optimization for 0/1 multiple knapsack problem
(International University - HCMC, 2019)
The 0/1 Multiple Knapsack Problem (01MKP) is the extension of the classical 0/1 Knapsack Problem (01KP), which is the well-known NP-hard problem in combinatorial optimization. In lieu of considering a single knapsack with ...
Flow shop scheduling problem: Gray wolf optimization algorithm (GWO)- A case study of scancom VietNam
(International University - HCMC, 2019)
Flow shop scheduling problems have important applications in manufacturing. The flow shop scheduling problem seeks to minimize the makespan, improve the efficiency of delivery system and hence raise the customers’ satisfactory. ...