A System-of-Systems Approach to Flexible Job-Shop Scheduling Using Column Generation

In the era of smart manufacturing, scheduling techniques play a crucial role in optimizing industrial processes. Among the various scheduling problems, the Flexible Job-Shop Scheduling Problem (FJSSP) represents a fundamental challenge due to the diversity of machines and production chains. The simultaneous management of routing and scheduling significantly increases complexity, making exact optimization methods impractical for large instances. This paper proposes a column generation approach to efficiently explore the solution space and improve makespan while significantly reducing computational time. The method iteratively refines the solution by generating promising columns, ensuring a trade-off between optimality and efficiency. Preliminary tests on medium and large instances, considering equivalent processing times, demonstrate that the proposed approach achieves near-optimal solutions at a considerably higher speed compared to traditional methods. These results highlight the potential of column generation as a viable strategy for addressing large-scale FJSSP instances in industrial applications.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/sose66311.2025.11083843
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A System-of-Systems Approach to Flexible Job-Shop Scheduling Using Column Generation

Alessandro Bozzi, Dritan Nace, Enrico Zero, Alban Zyle
1 links
Scheduling and Optimization Algorithms
article

A System-of-Systems Approach to Flexible Job-Shop Scheduling Using Column Generation

Alessandro Bozzi, Dritan Nace, Enrico Zero, Alban Zyle
article en

Abstract

In the era of smart manufacturing, scheduling techniques play a crucial role in optimizing industrial processes. Among the various scheduling problems, the Flexible Job-Shop Scheduling Problem (FJSSP) represents a fundamental challenge due to the diversity of machines and production chains. The simultaneous management of routing and scheduling significantly increases complexity, making exact optimization methods impractical for large instances. This paper proposes a column generation approach to efficiently explore the solution space and improve makespan while significantly reducing computational time. The method iteratively refines the solution by generating promising columns, ensuring a trade-off between optimality and efficiency. Preliminary tests on medium and large instances, considering equivalent processing times, demonstrate that the proposed approach achieves near-optimal solutions at a considerably higher speed compared to traditional methods. These results highlight the potential of column generation as a viable strategy for addressing large-scale FJSSP instances in industrial applications.

Heuristics and Diagnostics for Complex Systems (FR), University of Genoa (IT)
Decent work and economic growth
Openalex Percentile: Top 71%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.