Two Stage Optimization Algorithm for Resource Leveling Problem

Resource leveling in shipyard mid-term scheduling is critical for operational efficiency, yet existing approaches face significant limitations. Constraint programming methods suffer from computational scalability issues, while Meta Heuristic algorithms show restricted search space exploration. This study proposes a two-stage optimization framework integrating heuristic sequencing with reinforcement learning. In Stage 1, an Enhanced Kahn's Algorithm generates efficient activity sequences by incorporating resource requirements and durations. In Stage 2, Q-Learning dynamically determines optimal start times through episodic learning, progressively minimizing resource variance. Experimental evaluations using actual shipyard mid-term scheduling data demonstrate that the proposed algorithm achieves superior performance in large-scale problems compared to constraint programming and Meta Heuristic approaches. Results indicate that heuristic-based sequencing provides substantially improved computational efficiency, while reinforcement learning achieves rapid convergence and superior outcomes. This research establishes the practical applicability of integrating heuristics with reinforcement learning for complex industrial scheduling problems.

Authors

Publication Details

Journal
Journal of Korean Institute of Industrial Engineers
Published
2026-04-15
DOI
https://doi.org/10.7232/jkiie.2026.52.2.095
Primary Topic
Resource-Constrained Project Scheduling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Two Stage Optimization Algorithm for Resource Leveling Problem

Hong Lee, Jong Hun Woo
Journal of Korean Institute of Industrial Engineers
Resource-Constrained Project Scheduling
article

Two Stage Optimization Algorithm for Resource Leveling Problem

Hong Lee, Jong Hun Woo
article en

Abstract

Resource leveling in shipyard mid-term scheduling is critical for operational efficiency, yet existing approaches face significant limitations. Constraint programming methods suffer from computational scalability issues, while Meta Heuristic algorithms show restricted search space exploration. This study proposes a two-stage optimization framework integrating heuristic sequencing with reinforcement learning. In Stage 1, an Enhanced Kahn's Algorithm generates efficient activity sequences by incorporating resource requirements and durations. In Stage 2, Q-Learning dynamically determines optimal start times through episodic learning, progressively minimizing resource variance. Experimental evaluations using actual shipyard mid-term scheduling data demonstrate that the proposed algorithm achieves superior performance in large-scale problems compared to constraint programming and Meta Heuristic approaches. Results indicate that heuristic-based sequencing provides substantially improved computational efficiency, while reinforcement learning achieves rapid convergence and superior outcomes. This research establishes the practical applicability of integrating heuristics with reinforcement learning for complex industrial scheduling problems.

Journal of Korean Institute of Industrial EngineersVol. 52(2)
Openalex Percentile: Top 11%
Resource-Constrained Project Scheduling
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.