Scheduling tasks on computational grids is known as NPcomplete problem. Scheduling tasks in Grid computing, means assigning tasks to resources such that the time termination and average waiting time criteria and the number of required machines are optimized. Based on heuristic or meta-heuristic search have been proposed to obtain optimal solutions. The presented method tries to optimize all of ...

BACKGROUND The introduction of large-scale out-of-hours GP cooperatives has led to questions about increased distances between the GP cooperatives and the homes of patients and the increasing waiting times for home visits in urgent cases. We studied the relationship between the patient's waiting time for a home visit and the distance to the GP cooperative. Further, we investigated if other fact...

Conventional urban traffic control systems have been based on historical traffic data. Later advancements made use of detectors, which enabled the gathering of real-time traffic data, in order to re-organize and calibrate traffic signalization programs. Further evolvement provided the ability to forecast traffic conditions, in order to develop traffic signalization programs and strategies pre-c...

objectives the objective of this study was to evaluate factors influencing waiting time in patients of heart surgery centers, and to make recommendations for health-care policy-makers for reducing waiting time and increasing the quality of services from this perspective. patients and methods this cross-sectional study was performed in 2013. after searching articles on pubmed, elsevier, google s...

EASY-Backfilling is a popular scheduling heuristic for allocating jobs in large scale High Performance Computing platforms. While its aggressive reservation mechanism is fast and prevents job starvation, it does not try to optimize any scheduling objective per se. We consider in this work the problem of tuning EASY using queue reordering policies. More precisely, we propose to tune the reorderi...

We consider the problem of efficient operation of a barter exchange platform for indivisible goods. We introduce a dynamic model of barter exchange where in each period one agent arrives with a single item she wants to exchange for a different item. We study a homogeneous and stochastic environment: an agent is interested in the item possessed by another agent with probability p, independently ...