24th Conference of the International Federation of Operational Research Societies
Abstract Submission

4421. HCPGA-II: Upper Bound Heuristics and Constraint Handling Techniques for Hybrid JSSP Optimization

Invited abstract in session TF-43: Metaheuristics for Scheduling and Timetabling, stream Metaheuristics.

Tuesday, 16:15-17:45
Room: JUR – Seminar-Raum 63

Authors (first author is the speaker)

1. Chiara Camilla Rambaldi Migliore
Department of Information Engineering and Computer Science, University of Trento
2. Giovanni Iacca
University of Trento
3. Marco Roveri
University of Trento

Abstract

The Job Shop Scheduling Problem (JSSP) is an NP-hard problem critical to Industry 4.0, yet a gap persists between academic research and real-world deployment. Lorenzi et al. (GECCO 2025) proposed hcpga, a hybrid approach combining a CP solver (cp-sat) for initial feasible solutions with a Genetic Algorithm for refinement. We extend this work by evaluating industry-like instances, introducing heuristic upper bounds as CP constraints to accelerate initial solution search, and analyzing constraint handling techniques in the GA compared to the repair mechanism first introduced in hcpga.

Keywords

Status: accepted

Back to the list of papers