• Aucun résultat trouvé

Study on application possibilities of Case-Based Reasoning on the domain of scheduling problems

N/A
N/A
Protected

Academic year: 2021

Partager "Study on application possibilities of Case-Based Reasoning on the domain of scheduling problems"

Copied!
137
0
0

Texte intégral

Loading

Figure

Figure 1-1 – Recipe of example 1-1
Figure 1-3 – Recipe of example 1-2 (from Kondili et al., 1993) P1 Feed AHeating Reaction 2 Separation  P 2 Hot AInt ABImp EReaction 3Int BCReaction 1Feed BFeed C
Figure 1-5 – Recipe of example 1-3
Figure 1-6 – Workshop of example 1-3 Draft beer Draft beer Bright beer  P 1 P 2 P3 Bright beer
+7

Références

Documents relatifs

Comparison of mixed integer linear programming models for the resource- constrained project scheduling problem with consumption and production of resources. Multi-project

The paper shows that the expres- sivity of this language, mixing event-based and state-based models, is sufficient to model classical model-based diagnosis problems (logic-based

As soon as a regular minmax objective function is considered, the support for on-line schedul- ing most often lies in representing the solution as a m-vector of sequences of

The complete contact law (Signorini conditions + Coulomb friction laws) is a com- plex non smooth dissipative law including three statuses (no contact, contact with sti- cking

School of Engineering and Information Technology University of New South Wales, Canberra..

In the following sub-sections, we discuss how it is possible to use this sep- aration of the design process, that is dictated by many standards, to (i) define Design Space

Serratosa, A general model to define the substitu- tion, insertion and deletion graph edit costs based on an embedded space, Pattern Recognition Let- ters 138 (2020) 115 –

The self-paced reading study yielded the fol- lowing significant effects: (1) an effect of typical- ity on reading times (t = 2.28, p = .02) at the object region