.png){kind=icon}
Return
A graph-based constraint programming approach for the integrated process planning and scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105282.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Integrated process planning and scheduling
Constraint programming
CP Optimizer
Graph-based modelling
AND/OR graph
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
View more organizations
Cited Papers
A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling
PREAI
ShareSaveShareSaveShareSaveShareSave
ShareSaveShareSaveInheritance mode of fruit traits in melon: Heterosis for fruit shape and its correlation with genetic distance.png)
Euphytica
EuphyticaIF0
PREAI
ShareSave
View more