Production scheduling requires effective coordination of jobs, operations, machines, and processing times to reduce total completion time, particularly when the search space contains numerous feasible sequencing configurations. This study develops and evaluates a quantitative Genetic Algorithm (GA) approach for production scheduling with makespan minimization as the primary objective. A computational optimization design was implemented using a production instance comprising six jobs, 23 operations, and five machines. Candidate schedules were encoded as chromosomes and evaluated after decoding under technological precedence and machine-capacity constraints. The evolutionary procedure incorporated population initialization, fitness evaluation, selection, crossover, mutation, elitism, and a predefined termination criterion, while convergence was assessed through the best-so-far makespan across generations. The results demonstrate that the GA generated a feasible production schedule with a makespan of 45 minutes, compared with 83 minutes for the baseline schedule, corresponding to a 45.78% reduction in total production completion time. The optimization trajectory showed rapid improvement during the early generations, followed by progressively longer plateaus, before stabilizing at 45 minutes in generation 33. No further improvement occurred through the 60-generation termination limit. These findings indicate that a transparently configured, non-hybridized GA can substantially improve production completion efficiency while maintaining operational feasibility. The study provides a reproducible computational baseline for future investigations involving larger scheduling instances, repeated stochastic experiments, adaptive evolutionary operators, and more complex production constraints, and comparative benchmarking against alternative metaheuristic and exact optimization approaches.