A distributed system is a software system in which components located on networked computers communicate and coordinate their actions by passing messages. Most of the existing solutions on task scheduling and resource management in distributed computing environment are based on the traditional client/ server model, enforcing a homogeneous policy on making decisions and limiting the flexibility,...

The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization pr...

cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. it merges a lot of physical resources and offers them to users as services according to service level agreement. therefore, resource management alongside with task scheduling has direct influence on cloud networks’ performance and efficiency. presenting a proper scheduling ...

We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...

Choosing the best triangulation of a point set is a question that has been debated for many years. Two of the most well known choices are the mitt-max criterion and the max-min criterion. The max-min triangulation criterion has received the most attention over the years because efficient algorithms have been developed for determining this triangulation. The ability to construct such efficient a...