This study investigates the non-cyclic scheduling problem of dual-gripper robotic cells, which is becoming increasingly critical in high-mix low-volume manufacturing environments. While optimal algorithms have been developed, their exponential computational complexity limits their applicability to large-scale industrial scenarios. To bridge this gap, we propose two efficient heuristic approaches: a Dominance Property-based Heuristic Algorithm and a Heuristic by Beam Search. They relax the strict dominance conditions to accelerate the search process and employ an estimated average workload as a guide to prune the search tree. Experimental results on robotic cells with up to 500 jobs demonstrate that the proposed heuristics consistently generate high-quality schedules within a practical computation time.

1. 서 론1
2. 문제정의
3. 휴리스틱 알고리즘
    3.1 지배속성 완화 휴리스틱(DPHA)
    3.2 빔서치 기반 휴리스틱(HBS)
4. 계산실험
    4.1 실험환경 및 디자인
    4.2 실험결과
5. 결 론
Acknowledgments
References

• Jun-Ho Lee(School of Business, Chungnam National University) | 이준호 (충남대학교 경영학부)
• Hoon Jang(College of Global Business, Korea University) | 장훈 (고려대학교 글로벌비즈니스대학) Corresponding author