Abstract: Job-shop scheduling is a fundamental optimization issue in manufacturing. It involves determining the optimal allocation of many jobs among machines to increase makespan, throughput, and ...

This project implements six graph coloring algorithms — ranging from simple greedy heuristics to a customized, improved Genetic Algorithm (GA). The goal is to show how heuristic design strongly ...

$K$-means is one of the most widely-used algorithms to perform clustering and exploratory data analysis, since it allows identifying relevant patterns in data. Its ...