Iterated greedy algorithm with constraint programming for scheduling steelmaking-continuous casting process

DOI10.1016/J.EJOR.2025.11.023MaRDI QIDQ7233762zbMATH OpenFDO

Authors Dong-Yun Kim, Yeonjun Choi, Kyungduk Moon, Myungho Lee, Kangbok Lee, Michael L. Pinedo

Publication date 27 April 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.11.023

zbMATH Keywords

constraint programminghybrid flow shopiterated greedy algorithmschedulingsteelmaking-continuous casting (SCC) process

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A unified solution framework for flexible job shop scheduling problems with multiple resource constraints
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook
• Principles for the design of large neighborhood search
• Scheduling. Theory, algorithms, and systems
• Steel-making process scheduling using Lagrangian relaxation
• Underground mine scheduling of mobile machines using constraint programming and large neighborhood search

This page was built for publication: Iterated greedy algorithm with constraint programming for scheduling steelmaking-continuous casting process

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