Paradox in a Non-Linear Capacitated Transportation Problem
Parallel approximation to high multiplicity scheduling problems smooth multi-valued quadratic programming
We consider the parallel approximability of two problems arising from high multiplicity scheduling, namely the unweighted model with variable processing requirements and the weighted model with identical processing requirements. These two problems are known to be modelled by a class of quadratic programs that are efficiently solvable in polynomial time. On the parallel setting, both problems are P-complete and hence cannot be efficiently solved in parallel unless P = NC. To deal with the parallel...
Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming
We consider the parallel approximability of two problems arising from high multiplicity scheduling, namely the unweighted model with variable processing requirements and the weighted model with identical processing requirements. These two problems are known to be modelled by a class of quadratic programs that are efficiently solvable in polynomial time. On the parallel setting, both problems are P-complete and hence cannot be efficiently solved in parallel unless P = NC. To deal with the parallel...
Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem.
Parallel machine scheduling with uncertain communication delays
This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabilization scheme. This is applied to the m machine problem with communication delays: in our model an estimation...
Parallel Machine Scheduling with Uncertain Communication Delays
This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabilization scheme. This is applied to the m machine problem with communication delays: in our model an estimation...
Parallélisation d'une combinaison des méthodes de Monte-Carlo et quasi-Monte-Carlo et application aux réseaux de files d'attente
Parallélisation d'une Combinaison des Méthodes de Monte-Carlo et Quasi-Monte-Carlo et Application aux Réseaux de Files d'Attente
We propose a parallel algorithm which uses both Monte-Carlo and quasi-Monte-Carlo methods. A detailed analysis of this algorithm, followed by examples, shows that the estimator's efficiency is a linear function of the processor number. As a concrete application example, we evaluate performance measures of a multi-class queueing network in steady state.
Parallelization algorithms for modeling ARM processes.
Part and Machine Partitioning Problem in Cellular Manufacturing: Multiple Machine Environment
Partially clairvoyant scheduling for aggregate constraints.
Partially observable Markov decision processes with partially observable random discount factors
This paper deals with a class of partially observable discounted Markov decision processes defined on Borel state and action spaces, under unbounded one-stage cost. The discount rate is a stochastic process evolving according to a difference equation, which is also assumed to be partially observable. Introducing a suitable control model and filtering processes, we prove the existence of optimal control policies. In addition, we illustrate our results in a class of GI/GI/1 queueing systems where...
Partially observable queueing systems with controlled service rates under a discounted optimality criterion
We are concerned with a class of queueing systems with controlled service rates, in which the waiting times are only observed when they take zero value. Applying a suitable filtering process, we show the existence of optimal control policies under a discounted optimality criterion.
Particle swarm optimization with various inertia weight variants for optimal power flow solution.
Path functionals over Wasserstein spaces
Given a metric space we consider a general class of functionals which measure the cost of a path in joining two given points and , providing abstract existence results for optimal paths. The results are then applied to the case when is aWasserstein space of probabilities on a given set and the cost of a path depends on the value of classical functionals over measures. Conditions for linking arbitrary extremal measures and by means of finite cost paths are given.
Performance analysis of an M/G/1 retrial queue with non-persistent calls, two phases of heterogeneous service and different vacation policies.
Performance analysis of ATM multiplexer with Bernoulli traffic sources.
Performance analysis of multi-hop wireless packet networks.
Performance analysis of single server non-markovian retrial queue with working vacation and constant retrial policy
This paper analyses an M/G/1 retrial queue with working vacation and constant retrial policy. As soon as the system becomes empty, the server begins a working vacation. The server works with different service rates rather than completely stopping service during a vacation. We construct the mathematical model and derive the steady-state queue distribution of number of customer in the retrial group. The effects of various performance measures are derived.
Perishable inventory system with postponed demands and negative customers.