.png){kind=icon}
Return
Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods
.png){kind=icon}
PRE
AI
DOI：10.1016/S0098-1354(02)00100-X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper two strategies are presented to reduce the combinatorial complexity when solving single stage and multistage optimization scheduling problems that involve cost minimization and due dates. These problems can naturally be decomposed into assignment and sequencing subproblems. The proposed strategies rely on either combining mixed-integer programming (MILP) to model the assignment part and constraint programming (CP) for modeling the sequencing part, or else combining MILP models for both parts. The subproblems are solved sequentially by adding integer cuts to the first MILP to generate new assignments. Results are presented for both single and multistage systems. (C) 2002 Elsevier Science Ltd. All rights reserved.
Keywords:
mixed integer programming
constraint programming
hybrid strategy
multistage scheduling
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:
3.9
Papers:
8.1K
Citations:
1.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more