Discovering heuristics with large language models (LLMs) for mixed-integer programs: single-machine scheduling

DOI10.1016/J.COR.2025.107325MaRDI QIDQ6855205zbMATH OpenFDO

Authors İbrahim Oğuz Çetinkaya, İ. Esra Büyüktahtakın, Parshin Shojaee, Chandan K. Reddy

Publication date 23 February 2026

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2025.107325

zbMATH Keywords

algorithmsautomated heuristic discoverycombinatorial optimizationgenerative AIknowledge discoverylarge language models (LLMs)machine learning for optimizationmipoperations researchoptimizationschedulingsingle machine total tardiness scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
• A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• A decomposition algorithm for the single machine total tardiness problem
• A deep reinforcement learning framework for solving two-stage stochastic programs
• A Dynamic Programming Approach to Sequencing Problems
• A heuristic for the single machine tardiness problem
• A new decomposition approach for the single machine total tardiness scheduling problem
• A non-anticipative learning-optimization framework for solving multi-stage stochastic programs
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Learning optimal solutions via an LSTM-optimization framework
• Minimizing total tardiness on a single machine using ant colony optimization
• Minimizing Total Tardiness on One Machine is NP-Hard
• Multi-agent single machine scheduling
• On decomposition of the total tardiness problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
• Scheduling. Theory, algorithms, and systems.
• Single machine earliness and tardiness scheduling
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
• The single-machine total tardiness scheduling problem: review and extensions

This page was built for publication: Discovering heuristics with large language models (LLMs) for mixed-integer programs: single-machine scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6855205)