Country: United States

Found 17049 papers in total
Rapid and modular prototyping-based Petri nets and distributed simulation for manufacturing systems
Rapid and modular prototyping-based Petri nets and distributed simulation for manufacturing systems
2001,
This paper presents an approach to simulate and implement by stepwise refinement the...
Effective upper bounds for expected cycle times in tandem queues with communication blocking
Effective upper bounds for expected cycle times in tandem queues with communication blocking
2001,
Tandem queues with finite buffers have been widely discussed as basic models of...
Two queues in tandem with retrial customers
Two queues in tandem with retrial customers
2001,
We consider two single-server queues in tandem. The customers receive service at the...
Note on the GI/G/1 queue with LCFS-PR observed at arbitrary times
Note on the GI/G/1 queue with LCFS-PR observed at arbitrary times
2001,
Consider the GI/G/1 queue with the Last-Come First-Served Preemptive-Resume service...
On the comparison of queueing systems with their fluid limits
On the comparison of queueing systems with their fluid limits
2001,
In this article, we study a method to compare queueing systems and their fluid limits....
Threshold policies for a single-server queuing network
Threshold policies for a single-server queuing network
2001,
We consider a single-server queuing system with two job classes under service policies...
Comparison of queues with different discrete-time arrival processes
Comparison of queues with different discrete-time arrival processes
2001,
Traveling times in a first in first out (FIFO)-stochastic event graph are compared in...
Calculation of steady-state probabilities of M/M queues: Further approaches
Calculation of steady-state probabilities of M/M queues: Further approaches
2002,
This paper draws attention to the risk of rounding error in the numerical evaluation...
Algorithms for the on-line travelling salesman
Algorithms for the on-line travelling salesman
2001,
In this paper the problem of efficiently serving a sequence of requests presented in...
Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
2001,
In this paper, we study the chaotic mappings of complete multipartite graphs. The...
Efficient solution concepts and their relations in stochastic multiobjective programming
Efficient solution concepts and their relations in stochastic multiobjective programming
2001,
In this work, different concepts of efficient solutions to problems of stochastic...
Generalized pseudo univexity and duality in mathematical programming
Generalized pseudo univexity and duality in mathematical programming
2001,
In the present paper, some of the earlier duality results of Nanda and Das have been...
Adaptive use of iterative methods in predictor–corrector interior point methods for linear programming
Adaptive use of iterative methods in predictor–corrector interior point methods for linear programming
2000,
In this work we devise efficient algorithms for finding the search directions for...
Parallel interior-point method for linear and quadratic programs with special structure
Parallel interior-point method for linear and quadratic programs with special structure
2001,
This paper concerns the use of iterative solvers in interior-point methods for linear...
Fuzzy linear programming problems as bi-criteria optimization problems
Fuzzy linear programming problems as bi-criteria optimization problems
2001,
In this paper, we consider fuzzy linear programming (FLP) problems which involve fuzzy...
Exact algorithms for linear programming over algebraic extensions
Exact algorithms for linear programming over algebraic extensions
2001,
We study the computational complexity of linear programs with coefficients that are...
Bounded space on-line bin packing: Best is better than first
Bounded space on-line bin packing: Best is better than first
2001,
We present a sequence of new linear-time, bounded-space, on-line bin packing...
Efficient algorithms for integer programs with two variables per constraint
Efficient algorithms for integer programs with two variables per constraint
2001,
Given a bounded integer program with n variables and rn constraints, each with two...
On two class-constrained versions of the multiple knapsack problem
On two class-constrained versions of the multiple knapsack problem
2001,
We study two variants of the classic knapsack problem, in which we need to place items...
A second-order necessary condition for fractional programming
A second-order necessary condition for fractional programming
2001,
A treatment for multiobjective fractional programming problem has been given where use...
Existence of optimal stationary policies in finite dynamic programs with nonnegative rewards – an alternative approach
Existence of optimal stationary policies in finite dynamic programs with nonnegative rewards – an alternative approach
2001,
This article concerns Markov decision chains with finite state and action spaces, and...
Computing average optimal constrained policies in stochastic dynamic programming
Computing average optimal constrained policies in stochastic dynamic programming
2001,
A stochastic dynamic program incurs two types of cost: a service cost and a quality of...
Nondeterministic dynamic programming on a parallel coprocessing system
Nondeterministic dynamic programming on a parallel coprocessing system
2001,
We describe how nondeterministic dynamic programming (DP) algorithms can be designed...
A class of dual fuzzy dynamic programs
A class of dual fuzzy dynamic programs
2001,
In this paper we propose a large class of fuzzy dynamic programs. By use of the notion...
Papers per page: