The following class of matching problems is considered. The vertices of a complete und~res-This class of weighted graphs is applicable to scheduhng and optimal assignment problems. A maximum weighted (perfect) matching is found in O(n. log n) operations. 1. Introduction. The maximum matching problem has many applications in operations research. The first polynomial-time bounded algorithm for th...

The permutation flowshop scheduling problem with the objective of minimizing total flow time is known as a NP-hard problem, even for the two-machine cases. Because of the computational complexity of this problem, a multi-start simulated annealing (MSA) heuristic, which adopts a multi-start hill climbing strategy in the simulated annealing (SA) heuristic, is proposed to obtain close-to-optimal s...

We study a variety of online scheduling problems on a single processor that can be viewed as extensions of the well-studied problem of minimizing total weighted flow time. Most previous work on this class of problems has relied on amortized analysis and the use of complicated potential-function arguments. In this paper we follow a different approach based on the primal-dual and dual-fitting par...

In the era of high frequency trading and pervasiveness irregularly spaced trading, we control for time element in Modified Weighted Price Contribution (MWPC) model by Jahanshahloo Spokeviciute (2018). We empirically show that our new modification controls reaction (Speed) market participants to arrival information.

Introduction Flow weighted gradient echo MRI techniques can be used for angiography. Furthermore, these techniques allow to visualise the ventilation of aquatic animals (1). Therefore using MRI, it should be possible to observe ventilation and blood flow in marine animals at the same time. Biochemical investigations led to the hypothesis that thermal tolerance is limited by insufficient oxygen ...

Reverse time migration (RTM) is based on the two-way wave equation, so its imaging results obtained by conventional zero-lag cross-correlation conditions contain a lot of low-wavenumber noises. So far, wavefield decomposition method Poynting vector has been developed to suppress these noises; however, this also some problems, such as unstable calculation vector, low accuracy decomposition, and ...

In a weighted graph model, the reduction of flow between some pairs of nodes is more relevant and more frequent than the total disruption of the flow or the disconnection of the entire network. The concept of cuts are generalized to tackle with this type of problems. The classical edge and vertex connectivity parameters are generalized. Also a generalization of Whitney’s theorem is presented.

Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs.  In this paper, just-in-time (JIT) flow shop scheduling problem with preemp...

Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...