This paper proposes a new iterated greedy algorithm with a multi-operator approach and a large language model-assisted framework to enhance exploration and improve performance on the permutation flow shop scheduling problem.
This paper introduces a novel multi-operator iterated greedy algorithm and a large language model-assisted framework to improve the performance of the iterated greedy algorithm on the permutation flow shop scheduling problem.
Keywords
Before reading this…
Applications
To understand this paper, make sure you know these concepts first:
The permutation flow shop scheduling problem (PFSP) is a classical NP-hard combinatorial optimization problem in intelligent manufacturing. In practice, PFSP is commonly addressed using metaheuristic algorithms, among which the iterated greedy (IG) algorithm is widely adopted due to its simplicity and strong empirical performance. However, classical IG relies on a single fixed destruction operator, which often limits exploration and leads to search stagnation on large and complex problem instances. To address this issue, this work proposes a multi-operator IG algorithm, termed IG-DOE, which enhances exploration by switching among heterogeneous destruction operators along a single search trajectory. The core mechanism, called stagnation-triggered sequential switching, activates the next destruction operator in an ordered destruction operator ensemble (DOE) when stagnation is detected, thereby enriching the perturbation behavior of classical IG. Moreover, to reduce reliance on expert-crafted operators, a large language model (LLM)-assisted framework, termed SCOE, is introduced to automatically construct a high-quality DOE through stagewise evolution, state-awareness, and cooperative evaluation. Experiments on the challenging \textit{VRF-hard-large} benchmark show that the DOE evolved from smaller problem instances generalizes well to larger unseen instances. Under the same CPU-time limit, IG-DOE obtained much better average performance than QIG, a state-of-the-art IG algorithm. Additional experiments on real-world industrial-data-derived instances further show that the evolved DOE can generalize effectively to different data distributions without additional adaptation.
EPOCH: Coverage-Aware Evolution with Experiential Preference Optimization for LLM-based Automated He…
EPOCH proposes a framework that uses evolutionary search and reflection to impro…
Global Simulation-Guided Dynamic Operator Scheduling for Efficient Multi-Tenant Model Serving
This paper presents SliceScheduler, a dynamic operator-level scheduling system f…
An Evolutionary Algorithm Assisted by an Ensemble of Pareto-Optimal Surrogate Models
This paper proposes an adaptive ensemble method for surrogate-assisted evolution…
Mental Model Management: An Operator-Based Framework for LLM Memory
The paper introduces Mental Model Management (3M), a framework for representing…
LLM Ensemble Fault Classification for Automotive HiL Validation
This paper proposes an explainable multi-LLM ensemble framework for sensor-level…
From Intents to Algorithms: Verified Algorithm Discovery for Transport Networks
This paper presents VERA-TN, a verification-guided framework that uses a large l…
SPEAR: A Spectral-Disentangled MoE Neural Operator with Knowledge-Guided Expert Aggregation for Larg…
This paper proposes SPEAR, a spectral-disentangled MoE neural operator for large…
Multi-Agent Reinforcement Learning for Online Traffic Scheduling in Time-Sensitive Application
This paper proposes a multi-agent reinforcement learning framework for time-sens…