约束规划
数学优化
计算机科学
调度(生产过程)
水准点(测量)
约束满足
约束(计算机辅助设计)
作业车间调度
灵活性(工程)
数学
地铁列车时刻表
随机规划
人工智能
操作系统
地理
几何学
统计
概率逻辑
大地测量学
作者
Ganquan Shi,Zhouwang Yang,Yang XU,Yuchen Quan
标识
DOI:10.1080/00207543.2021.1963496
摘要
Due to various factors of flexibility introduced into manufacturing systems, researchers have gradually shifted their focus to the integrated process planning and scheduling (IPPS) problem to improve productivity. The previous literature rarely associates IPPS with constraint programming, even though constraint programming has achieved success in the scheduling field. Furthermore, existing approaches are usually customized to certain types of IPPS problems and cannot handle the general problem. In this paper, with a view to obtaining the optimal AND/OR graph automatically, a depth first search generating algorithm is designed to convert the type-1 IPPS problem into our approach's standard input format. Moreover, we propose an approach based on enhanced constraint programming to cope with the general problem, employing advanced schemes to enhance the constraint propagation and improve the search efficiency. Our approach is implemented on ORTOOLS, and its superiority is verified by testing on 15 benchmarks with 50 instances. Experimental results indicate that 41 instances are solved optimally, among which the optimality of the solutions for 20 instances is newly confirmed, and the solutions of six instances are improved. Our approach is the first method to reach the overall optimum in the most influential benchmark with 24 instances.
科研通智能强力驱动
Strongly Powered by AbleSci AI