| Popis: |
This work presents a novel, efficient and expressive Constraint Programming (CP) approach to the short-term scheduling problem of multistage batch plants. The CP model accounts for many features found in industrial settings and allows modeling operational policies that group batches of the same product into campaigns. Product campaigns simplify the plant operation and allow reducing scrap and changeover times. The formulation has been extensively tested with various examples, including large-scale ones, and different objective functions. Comparisons with results reported in recent contributions are also presented and discussed. |
