返回
A graph-based constraint programming approach for the integrated process planning and scheduling problem
DOI:10.1016/j.cor.2021.105282.png)
摘要
En 中文
Integration of process planning and scheduling (IPPS) is to carry out both functions simultaneously. This paper provides a graph-based constraint programming (GCP) approach to solve the type-2 IPPS problem that takes AND/OR graphs as input. The proposed GCP approach is implemented based on the IBM ILOG CP Optimizer. AND/OR graph is tailored to cope with IPPS instances. Directed arcs define both precedence and presence relationships. The or-link, a set of mutually-exclusive operations, is defined to represent alternative process routes. Interval variables and scheduling-oriented constraints are adopted to project the IPPS-specific AND/OR graph to a concise CP model with which minimizing makespan is incorporated as the objective. The GCP approach is tested on a set of benchmark problems. Experimental results show that the proposed approach outperforms compared algorithms on major IPPS instances. (C) 2021 Elsevier Ltd. All rights reserved.
Keyword:
Integrated process planning and scheduling
Constraint programming
CP Optimizer
Graph-based modelling
AND/OR graph
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Integration of process planning and scheduling for distributed flexible job shops分布式柔性作业车间的工艺规划与调度集成
Inheritance mode of fruit traits in melon: Heterosis for fruit shape and its correlation with genetic distance
Euphytica
IF0

