This paper provides a new simple heuristic algorithm for a ‘3-Machine, njob’ flow-shop scheduling problem in which jobs are attached with weights to indicate their relative importance and the transportation time and break down intervals of machine are given. A heuristic approach method to find optimal or near optimal sequence minimizing the total weighted mean production flow time for the probl...

In estimating the inputs into the Modern Portfolio Theory (MPT) portfolio optimisation problem it is usual to use equal weighted historic data. Equal weighting of the data, however, does not take account of the current state of the market. Consequently this approach is unlikely to perform well in any subsequent period as the data is still reflecting market conditions that are no longer valid. T...

Abstract The weighted Yamabe problem introduced by Case is the generalization of Gagliardo-Nirenberg inequalities to smooth metric measure spaces. More precisely, given a space ( M , g e − ϕ <m:mi mathvariant="norm...

This paper is about scheduling parallel jobs, i.e. which can be executed on more than one processor at the same time. Malleable jobs is a special class of parallel jobs. The number of processors a malleable job is executed on may change during the execution. In this work, we consider the NP-hard problem of scheduling malleable jobs to minimize the total weighted completion time or mean weighted...

background :inversion recovery (ir) pulse sequences can generate t1-weighted images with a different range of inversion time (ti) to suppress or null the signal intensity (si) for a specified tissue. in this study, we aimed to investigate the effect of ti values on the concentration of the contrast agent, which leads to a minimum signal intensity, using an inversion recovery t1-weighted 3-dimen...

We introduce approximation algorithms and strong NP-completeness results for interdiction problems on planar graphs. Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded graph. We give a multiplicative (1+ǫ)-approxi...

Stochastic particle-resolved methods are a useful way to compute the time evolution of the multi-dimensional size distribution of atmospheric aerosol particles. An effective approach to improve the efficiency of such models is the use of weighted computational particles. Here we introduce particle weighting functions that are power laws in particle size to the recently-developed particle-resolv...

A major issue for policy makers and planners is the definition of the “ideal” regional partition, i.e. the delimitation of sub-regional domains showing a sufficient level of homogeneity with respect to some specific territorial features. In Sardinia, the second major island in the Mediterranean sea, politicians and analysts have been involved in a 50 year process of identification of the correc...

We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic flows are served in accordance with the Generalized Processor Sharing (GPS) discipline. GPS-based scheduling algorithms, such as Weighted Fair Queueing (WFQ), have emerged as an important mechanism for achieving service differentiation in integrated networks. We derive the asymptotic workload behavior...

For the purpose of visualizing low-flow as well as high-flow blood vessels without using contrast agents, we propose a new technique called a hybrid of opposite-contrast MR angiography (HOP-MRA). HOP-MRA is a combination of standard time-of-flight (TOF) using a full first-order velocity-compensation for white-blood (WB) and flow-sensitive black-blood (FSBB) techniques, which use motion-probing ...