期刊
COMPUTERS & OPERATIONS RESEARCH
卷 131, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2021.105282
关键词
Integrated process planning and scheduling; Constraint programming; CP Optimizer; Graph-based modelling; AND/OR graph
类别
资金
- National Natural Science Foundation of China [71501187]
This paper presents a graph-based constraint programming approach to solve the integration of process planning and scheduling problem, implemented based on IBM ILOG CP Optimizer. Experimental results show that the proposed approach outperforms compared algorithms on major IPPS instances.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据