00000ctmaa22000003a 4500 UP-1685675941123923162 Buklod 20150923115754.0 aa rb |||1 u| ta 150923s xx d r |||| u| (iLib)UPTAC-00017614667 UPVTC eng LG 993.5 2011 C66 C38 Catalan, Ryan M. author. JobCats solving cryptarithmetic puzzle using CSO algorithm Ryan M. Catalan; John Paul T. Yusiong, adviser. 2011. [3], 64 leaves illustrations, photos 1 CD Rom (4 3/4 in.). Undergraduate thesis (B.S. in Computer Science) -- University of the Philippines, Tacloban. Job Shop Scheduling Problem (JSSP) is a difficult scheduling problem that has no easy way of getting the optimal value. This problem is well-studied because of its various real-world applications especially in the field manufacturing and service industries since JSSP tends to improve some measures of performance especially the maximum completion time (makespan) that is necessary in businesses. JSSP is among the hardest combinational optimization problems and is classified as an NP-hard problem that is why a lot of optimization algorithms were used to solve JSSP and some have promising results. Inthis paper another optimization algorithm based on the behavior of cats, the Cat Swarm Optimization of CSO algorithm was used to solve JSSP. Experiment results show that CSO was able to find and solve for the optimal value for every JSSP instance used in this paper. These results indicate that CSO is a feasible algorithm in soving Job Scheduling Problems. Cat Swarm Optimization algorithm. Job Sop Scheduling Problems. Yusiong, John Paul T. adviser. FI UP UPTAC UPTAC LG 993.5 2011 C66 C38 Thesis