The paper surveys the complexity results for job shop, flow shop, open shop and mixed shop scheduling problems when the number n of jobs is fixed while the number r of operations per job is not restricted. In such cases, the asymptotical complexity of scheduling algorithms depends on the number...

We analyze a two-node tandem queue with Brownian input. We first derive an explicit expression for the joint distribution function of the workloads of the first and second queue, which also allows us to calculate their exact large-buffer asymptotics. The nature of these asymptotics depends on...

The paper proposes a new approach to the mean–variance-hedging problem under transaction costs. This approach is based on the idea of dividing the gain functional into two parts. One part representing the gains resulting from a pure buying strategy, and the other part representing the gains...

First order necessary conditions and duality results for general inexact nonlinear programming problems formulated in nonreflexive spaces are obtained. The Dubovitskii–Milyutin approach is the main tool used. Particular cases of linear and convex programs are also analyzed and some comments...

By introducing a random interference into the typical of nonlinear time series model, this paper establishes a RENLAR model: <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$X_{n+1}=T(X_n)+ e_{n+1}(Z_{n+1})$$</EquationSource> </InlineEquation>. The author introduces the definition of adjoint non-recurrence, and utilizing general state space Markov chain theorem, we obtain...</equationsource></inlineequation>