In this paper we propose an improved formulation for an unrelated parallel machine problem with machine and job sequence-dependent setup times that outperforms the previously published formulations regarding size of instances and CPU time to reach optimal solutions. The main difference between the proposed formulation and previous ones is the way the makespan has been linearized. It provides im...

Access to earlier process instances Access to earlier process instances

Ontology mapping is the process whereby two ontologies are semantically related at conceptual level and the source ontology instances are transformed into target ontology entities according to those semantic relations. The objective of MAFRA–MApping FRAmework – is to cover all the phases of the ontology mapping process, including analysis, specification, representation, execution and evolution....

in this article, the discrete time state space model with first-order autoregressive dependent process noise is considered and the recursive method for filtering, prediction and smoothing of the hidden state from the noisy observation is designed. the explicit solution is obtained for the hidden state estimation problem. finally, in a simulation study, the performance of the designed method ...

We focus on the random generation of SAT instances that have properties similar to real-world instances. It is known many industrial instances, even with a great number variables, can be solved by clever solver in reasonable amount time. This not possible, general, classical randomly generated provide different model called \emph{scale-free instances}. based use non-uniform probability distribu...