Abstract We study the concept of continuous mean distance a weighted graph. For connected unweighted graphs, can be defined as arithmetic distances between all pairs vertices. This parameter provides natural measure compactness graph, and has been intensively studied, together with several variants, including its version for graphs. The analog (discrete) is points on edges Despite being very ge...

We introduce FlowFlex, a highly generic and effective scheduler for flows of MapReduce jobs connected by precedence constraints. Such a flow can result, for example, from a single user-level Pig, Hive or Jaql query. Each flow is associated with an arbitrary function describing the cost incurred in completing the flow at a particular time. The overall objective is to minimize either the total co...

EDSs are an important part of patient care and medical communication. The GWH has a financially motivated target stating that 95% of EDS are to be completed within 24 hours of patient discharge. On review of a six-week pre-intervention period, the medical ward mean weekly EDS completion rate within 24 hours was 74.3%. EDSs form a significant part of junior doctor workload. We found that on a me...

In the flow shop mean completion time problem, a set of jobs has to be processed on m-machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize the sum of the completion times of all jobs on the final machine. In this paper, we prove the asymptotic o...

 The m-machine no-wait flowshop scheduling problem is addressed by taking into account two performance measures of makespan and mean completion time. The objective is to minimize makespan such that mean completion time is less than a certain value. A dominance relation is provided for a special case of the problem. Moreover, two new heuristics are proposed in this paper. Computational analysis...