Search
Now showing items 1-4 of 4
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. ...
University Course Timetabling Using Grey Wolf Optimizer: A Case Study Of International University
(2020-08)
Building a university course timetabling (UCT) can be defined as an NP-hard problem, and some
of the problems that needs addressing are classrooms, faculty members, students, and courses. This
is a difficult issue with ...
Applying Grey Wolf Optimization In Solving The Nurse Scheduling Problem
(2020-08)
The Nurse Scheduling Problem (NSP) has been a widely studied research topic
in the last several decades. It is defined as the operation research of allocating shifts to
available nurse over a planning period, typically ...