A sensor network in the field is usually required to support multiple sensing tasks or missions to be accomplished simultaneously. Since missions might compete for the exclusive usage of the same sensing resource we need to assign individual sensors to missions. Missions are usually characterized by an uncertain demand for sensing resource capabilities. Consider for example a mission that requi...

We consider the capacity planning of telecommunication networks with linear investment costs and uncertain future tra c demands. Transmission capacities must be large enough to meet, with a high quality of service, the range of possible demands, after adequate routings of messages on the created network. We use the robust optimization methodology to balance the need for a given quality of servi...

Conventional routing management approaches, which are based on given and often ”worst case” traffic matrices, are not sufficient anymore to deal with the increasing growth of the number of endpoints and diverse applications in IP networks. Traffic variations are becoming a more and more important issue, especially when making long-term network planning decisions as well as for medium-term netwo...

The purpose of the paper is to present a hybrid algorithm to solve a transportation optimization model with random demand parameters and network design variables. At first, the classical deterministic linear transportation model with network design 0-1 variables is introduced. Then, randomness is considered for demand parameters and modeled by here-and-now approach. The obtained scenario-based ...

This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. The list of the demands is divided in two sets: the actual demand, which is considered as certain ...

The problem of how t,o design mukiproduct batch plant,s for the case of uncertain product demands described by any continuous/discrete probability distributional form, is considered in this paper. Based on a stochastic programming formulation, featuring an objective function comprising investment costs for equipment sizing, expected revenues from product sales and a pena.lty term accounting for...

We consider the problem of distributing goods from one or more plants through a set of warehouses in anticipation of forecasted customer demands. Two results are provided in this paper. First, we present a methodology for approximating stochastic distribution problems that are computationally tractable for problems of realistic size. Comparisons are made to standard deterministic formulations a...

We consider the capacity planning of telecommunications networks with linear investment costs and uncertain future traffic demands. Transmission capacities must be large enough to meet, with a high quality of service, the range of possible demands, after adequate routings of the traffic on the created network. We use the robust optimization methodology to balance the need for a given quality of...

A key challenge confronting wide-area network architects is validating that their network designs provide assurable performance in the face of variable traffic demands and failures. Validation is hard because of the exponential, and possibly non-enumerable, set of scenarios that must be considered. Current theoretical tools provide overly conservative bounds on network performance since to rema...