Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. A Variable Neighborhood Genetic Algorithm (VNGA) is proposed for the problem with makespan criterion, consisting of a combination of the variable neighborhood search (VNS) and genetic algorithm (GA). Variable ne...

The simplicity of the maximum satisfiability problem (MAX-SAT) combined with its applicability in many areas of artificial intelligence and computing science made it one of the fundamental optimization problems. This NP-complete problem refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weights of satisfied clauses) in a Boolean formu...

In this researcha particle swarm optimization (PSO) algorithm is proposedfor no-wait flowshopsequence dependent setuptime scheduling problem with weighted earliness-tardiness penalties as the criterion ( | , | ∑ " ).The smallestposition value (SPV) rule is applied to convert the continuous value of position vector of particles in PSO to job permutations.A timing algorithm is generated to find t...

Adaptive Bayes Network (ABN) is a fast algorithm for constructing Bayesian Network classifiers using Minimum Description Length (MDL) and automatic feature selection. ABN does well in domains where Naive Bayes fares poorly, and in other domains is, within statistical bounds, at least as good a classifier.

This project aims to classify the optional practical training comments using a naive Bayes classifier. We demonstrate the effectiveness of the naive Bayes approach and further enhance its performance using a simplified form of an expectation maximisation algorithm. We explore how sentiments change over time, and also provide preliminary results that help in understanding how sentiments vary wit...

Classification problems have a long history in the machine learning literature. One of the simplest, and yet most consistently well performing set of classifiers is the Näıve Bayes models. However, an inherent problem with these classifiers is the assumption that all attributes used to describe an instance are conditionally independent given the class of that instance. When this assumption is v...

Recent advancements in drone technology are opening new opportunities and applications: various fields of life especially the form small drones. However, these also causing challenges terms security, adaptability, consistency. Small drones proving to be a opportunity for civil military industries. The suffering from architectural issues definition security safety issues. rapid growth Internet t...

Social media is a computer application designed to make it simpler communicate with others without having do face-to-face, as well tool for fun and reducing feelings of isolation. Existing social applications include games, music, communicating distant individuals, among others. These are utilized by parents, adolescents, even young children. The Tik-Tok frequently used children networking plat...

Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding shortest complete close tour in graph. This study seeks to solve this using Artificial Bee Colony (ABC) Algorithm along with proposed Discrete Nearest Neighborhood (DNNA). DNNA finds path among points by starting from an arbitrary point. In next steps links will be a guide make tour. other words par...