Abstract: A method, apparatus and product for real-time update of a Mobile Workforce Scheduling Problem (MWSP), which comprises: agents and tasks to be performed by the agents, wherein a schedule which solves the mobile workforce scheduling problem exists and is being implemented by the agents. The method comprising: monitoring real time information update events provided to a Business Rule Management System (BRMS), activating, by the BRMS, business rules for schedule change detection; in response to a determination that re-planning is desired, automatically determining, using business rules, a portion of the MWSP to be re-planned; providing the portion of the MWSP to a MWSP solver; receiving from the MWSP solver, a new schedule for the portion of the MWSP; and updating the schedule based on the new schedule, whereby a first portion of the schedule is updated and a second portion of the schedule remains unchanged.

Abstract: A method comprising: obtaining a first viewpoint representing a partial depiction of a system, wherein the first viewpoint comprises a property base, an instance base and a class base; obtaining a second viewpoint representing a partial depiction of the system, wherein the second viewpoint comprises a property base, an instance base and a class base, wherein the instance base of the second viewpoint is different than the instance base of the first viewpoint; creating a third viewpoint based on the first and second viewpoints, wherein the third viewpoint representing the system, wherein the third viewpoint comprises a property base, an instance base and a class base, wherein the instance base comprises instances defined by the instance base of the first viewpoint and instances defined by the instance base of the second viewpoint.

Abstract: Method, system and product for decomposing a simulation model. The method comprising automatically decomposing the simulation model into a predetermined number of co-simulation components, wherein each co-simulation component is allocated to a different simulation platform, wherein said automatically decomposing comprises: defining a target optimization function, wherein the target optimization function computes an estimated run time of the simulation model, wherein the target optimization function is based on a communication time within each co-simulation component and a communication time between each pair of co-simulation components; and determining a decomposition of the simulation model that optimizes a value of the target optimization function. The method further comprises executing the decomposed simulation model by executing in parallel each co-simulation component on a different simulation platform, whereby the simulation model is executed in a distributed manner.

Abstract: A method, system, and product for simulation of Internet of Things (IoT) environment. The method performed by a simulation node in the IoT environment, which comprises the simulation node and a cloud server connected by a computerized network. The method comprises selecting a simulated IoT device to simulate from a plurality of simulated IoT devices that are being simulated by the simulation node; invoking a real-world model to obtain real-world simulated values; determining a simulated behavior of the selected simulated IoT device by invoking a device model and providing the real-world simulated values thereto, o wherein the simulated behavior comprises transmitting a message to the cloud server; setting a next simulated action of the simulation node to occur at a designated time, wherein the next simulated action is the simulated behavior; and performing the next simulated action at the designated time.

Abstract: A computer-implemented method, computerized apparatus and computer program product for decomposing multisite heterogeneous workforce scheduling problems. An instance of a multisite heterogeneous workforce scheduling problem comprising a set of work items and a set of technicians is obtained. A measure of likelihood that a pair of work items belong to the same sub-problem in a decomposition of the problem instance into a plurality of sub-problems, such that a union of solutions to the plurality of sub-problems is a solution to the problem, is calculated. The measure calculation comprises calculating one or more components indicating a relation between the pair of work items and technicians potentially scheduled to execute either of them. A solution to the problem is generated by solving the plurality of sub-problems in the decomposition obtained based on a partitioning of the set of work items induced by the measure and aggregating solutions to the plurality of sub-problems.

Abstract: A computer-implemented method, apparatus and computer program product, the method performed by a processor operatively connected to a memory, the method comprising: obtaining a schedule for handling service requests, the schedule planned offline in accordance with expected service requests for a service, the schedule comprising a number of service trips per time slot and per geographic location; receiving a service request, comprising a location in which the service is to be provided; automatically suggesting, during handling the service request, a time slot for providing the service from time slots available in the schedule for providing the service in the location; and upon acceptance of the time slot for providing the service, updating the schedule with the service being provided at the time slot.

Abstract: A computer program product comprising a non-transitory computer readable storage medium retaining program instructions configured to cause a processor to perform actions, which program instructions implement: a framework for creating a model of an NP-hard problem, the model comprising at least one entity selected from the group comprising: an objective, a variable, an equation and a constraint, wherein the framework provides methods for automatically transforming the model, comprising: one or more methods for manipulating or changing a status of the entity of the model, the methods comprising a method for imposing or ignoring the constraint; and one or more methods related to operations to be applied to the entity of the model.

Abstract: A computer implemented method of optimizing an execution of a process by applying adjustable robust optimization, comprising: 1) Designating an optimization function for calculating an optimal solution for a process execution comprising a plurality of ordered events. The process execution depends on a plurality of uncertain variables. 2) Identifying an adjustment which sets a value for one or more adjusted variables of the plurality of uncertain variables. The adjustment is derived from one or more decisions made by a user. The one or more decisions define an order of one or more ordered events to execute a particular realization of the process execution. 3) Applying the one or more adjusted variables to the optimization function which calculates the optimal solution. 4) Outputting the optimal solution to the user.

Abstract: A method comprising obtaining a scheduling problem comprising: a set of agents and a set of tasks to be performed by the set of agents, wherein solving the scheduling problem using an automated solver is not feasible using available predetermined resources. The method comprises automatically generating a plurality of alternative scheduling problems, wherein a solution to each such alternative scheduling problem defines a solution to the scheduling problem and determining a solution to the scheduling problem by applying the automated solver to solve, while using the available predetermined resources, an alternative problem of the plurality of alternative scheduling problems to determine a solution to the alternative problem and by mapping the solution to the alternative problem to the scheduling problem, whereby determining the solution.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include receiving, by a computer executing a system modeling application, a first input including multiple attributes and a second input including multiple components. The attribute set is associated with a plurality of the components in the system model, and based on a third input received that includes calculation parameters, one or more calculations are defined that include one or more of the attributes over the plurality of the components, thereby defining a metric for the system model.

Abstract: A method comprising: obtaining a first viewpoint representing a partial depiction of a system, wherein the first viewpoint comprises a property base, an instance base and a class base; obtaining a second viewpoint representing a partial depiction of the system, wherein the second viewpoint comprises a property base, an instance base and a class base, wherein the instance base of the second viewpoint is different than the instance base of the first viewpoint; creating a third viewpoint based on the first and second viewpoints, wherein the third viewpoint representing the system, wherein the third viewpoint comprises a property base, an instance base and a class base, wherein the instance base comprises instances defined by the instance base of the first viewpoint and instances defined by the instance base of the second viewpoint.

Abstract: A method for concise modeling including receiving a first model mapping a plurality of prototype connections between a plurality of prototype objects, receiving at least one dataset having a plurality of optional objects, each object matching one of the prototype objects, and automatically constructing a second model having at least one of the optional objects mapped according to the first model.

Abstract: Systems and methods for admission control to a physical host system are provided herein. One aspect provides for receiving at least one resource request at an admission control component of a distributed computing system, the at least one resource request comprised of at least one system type; processing the at least one resource request utilizing at least one physical host accessible to the distributed computing system; specifying a number of resource request slots to be reserved for at least one system type based on at least one future reservation threshold accessible to the admission control component; and blocking resource requests from entering the system through the admission control component based on a number of available resource request slots and the at least one future reservation threshold. Other embodiments and aspects are also described herein.

Abstract: A novel and useful system and method of decentralized decision-making for real-time scheduling in a multi-process environment. For each process step and/or resource capable of processing a particular step, a service index is calculated. The calculation takes into account several measures, such as business level measures, operational measures and employee level measure. The decision of which process step a resource should next work on or what step to assign to a resource is based on the service index calculation and, optionally, other production factors. In one embodiment, the resource is assigned the process step with the maximal service index. Alternatively, when a resource becomes available, all process steps the resource is capable of processing are presented in order of descending service index. The resource then selects which process step to work on next.

Abstract: A computerized method of providing a multiobjective optimal design through user interactive navigation, comprising: 1) Designating a user reference design which defines multiple objectives in a design space. 2) Exploring the design space to identify a multiobjective optimal design, evolved from the reference design, through multiple navigation iterations. During each iteration the user is interacted to reach an intermediate candidate design which is closer to a Pareto frontier. Each iteration comprising: (a) Identifying and presenting the user, optimal designs which are closer to the Pareto frontier and are within a pre-defined evolution distance from an intermediate design of previous iteration, improving one or more of the objectives. (b) Selecting a preferred design from those candidate designs, according to user instructions, the preferred design is used as the starting point for the next iteration.

Abstract: A computerized method, system and computer product for automatic architecture generation is disclosed. The computerized method includes receiving a functional description of an architecture of a system, wherein the system architecture includes a plurality of functions and a plurality of functional links between the functions, receiving or defining at least one functional failure case and its maximum allowed failure probability, defining an algebraic function approximating the probability of occurrence of each failure case, automatically generating an optimized architecture using an optimization solver wherein all architecture's one approximated failure probabilities are smaller than the maximum allowed probability for the respective failure cases and outputting the automatically generated architecture.

Abstract: A method of creating a system having pluggable analysis viewpoints over a design space model based on templates for analytical representation of different system aspects, comprising: a) Ontologically representing each of a plurality of system viewpoints with a subset of the components and classes using attributes and inter-attribute relationships. b) Automatically creating a unified design space model represented by the design space components according to a plurality of user defined pluggable analysis viewpoints and modeling viewpoints. c) Automatically generating a design space model derived from a plurality of analysis and modeling viewpoints. d) Receiving at least one change marked by a user with respect to a certain one of the plurality of analysis and modeling viewpoints. e) Automatically updating the design space model and the plurality of viewpoint models to reflect the at least one change. f) Outputting the updated design space model and the plurality of viewpoint models.

Abstract: A method for concise modeling comprising: receiving a first model mapping a plurality of prototype connections between a plurality of prototype objects; receiving at least one dataset having a plurality of optional objects each said object matching one of said plurality of prototype objects; and automatically constructing a second model having at least one of said plurality of optional objects mapped according to said first model.

Abstract: A method of interactively achieving a Pareto-optimal design of systems is provided herein. The method includes the following stages: generating a system model containing elements that are associated with design parameters and design alternatives, as well as directives for calculating the system's measures of effectiveness (being the optimization objectives); exploring a plurality of design configurations all satisfying specified system constraints, meeting a Pareto optimal condition over the objective space, and representing different areas of the design and objective spaces; presenting a user with the determined set of design configurations; allowing the user to choose a range of interest, and repeating the exploring and presenting stages, wherein in each repetition, the exploring is carried out within a smaller sub-range, until the user makes a final selection of a design configuration.

Abstract: Systems and methods for admission control to a physical host system are provided herein. One aspect provides for receiving at least one resource request at an admission control component of a distributed computing system, the at least one resource request comprised of at least one system type; processing the at least one resource request utilizing at least one physical host accessible to the distributed computing system; specifying a number of resource request slots to be reserved for at least one system type based on at least one future reservation threshold accessible to the admission control component; and blocking resource requests from entering the system through the admission control component based on a number of available resource request slots and the at least one future reservation threshold. Other embodiments and aspects are also described herein.