On the optimal control of single-stage hybrid manufacturing systems via novel and different variants of particle swarm optimization algorithm.
On the optimality of inventory policies: A quasivariational approach.
On the optimum organization of calculations in a decision system
On the Pallet Loading Problem
On the power of randomization for job shop scheduling with -units length tasks
In the job shop scheduling problem -units-, there are machines and each machine has an integer processing time of at most time units. Each job consists of a permutation of tasks corresponding to all machines and thus all jobs have an identical dilation . The contribution of this paper are the following results; (i) for jobs and every fixed , the makespan of an optimal schedule is at most , which extends the result of [3] for ; (ii) a randomized on-line approximation algorithm for -units-...
On the power of randomization for job shop scheduling with k-units length tasks
In the job shop scheduling problem k-units-Jm, there are m machines and each machine has an integer processing time of at most k time units. Each job consists of a permutation of m tasks corresponding to all machines and thus all jobs have an identical dilation D. The contribution of this paper are the following results; (i) for jobs and every fixed k, the makespan of an optimal schedule is at most D+ o(D), which extends the result of [3] for k=1; (ii) a randomized on-line approximation...
On the preemptive priority queues
On the queue-size distribution in the multi-server system with bounded capacity and packet dropping
A multi-server -type queueing system with a bounded total volume and finite queue size is considered. An AQM algorithm with the “accepting” function is being used to control the arrival process of incoming packets. The stationary queue-size distribution and the loss probability are derived. Numerical examples illustrating theoretical results are attached as well.
On the rate of convergence to the neutral attractor of a family of one-dimensional maps
For a family of maps , d ∈ [2,∞], p ∈ [0,1]. we analyze the speed of convergence (including constants) to the globally attracting neutral fixed point p = 0. The study is motivated by a problem in the optimization of routing. The aim of this paper is twofold: (1) to extend the usage of dynamical systems to unexplored areas of algorithms and (2) to provide a toolbox for a precise analysis of the iterates near a non-degenerate neutral fixed point.
On the Single-Server Retrial Queue
On the solution of a class of location problems. A sample problem
On the structure of the solution of the allocation problem
On the survival time of a duplex system: A Sokhotski-Plemelj problem.
On the total working time of a repaired unit
On the virtual waiting time for an retrial queue with two types of calls.
On the weak robustness of fuzzy matrices
A matrix in -algebra (fuzzy matrix) is called weakly robust if is an eigenvector of only if is an eigenvector of . The weak robustness of fuzzy matrices are studied and its properties are proved. A characterization of the weak robustness of fuzzy matrices is presented and an algorithm for checking the weak robustness is described.
On transient queue-size distribution in the batch-arrivals system with a single vacation policy
A queueing system with batch Poisson arrivals and single vacations with the exhaustive service discipline is investigated. As the main result the representation for the Laplace transform of the transient queue-size distribution in the system which is empty before the opening is obtained. The approach consists of few stages. Firstly, some results for a ``usual'' system without vacations corresponding to the original one are derived. Next, applying the formula of total probability, the analysis of...
On transitive orientations of G-ê
A comparability graph is a graph whose edges can be oriented transitively. Given a comparability graph G = (V,E) and an arbitrary edge ê∈ E we explore the question whether the graph G-ê, obtained by removing the undirected edge ê, is a comparability graph as well. We define a new substructure of implication classes and present a complete mathematical characterization of all those edges.
On weighted synthesis of judgements.
On weighted synthesis of judgements. (Short Communication).