On weighted synthesis of judgements.
On weighted synthesis of judgements. (Short Communication).
On ƒ-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes
Motivated by the wavelength division multiplexing in all-optical networks, we consider the problem of finding an optimal (with respect to the least possible number of wavelengths) set of ƒ+1 internally node disjoint dipaths connecting all pairs of distinct nodes in the binary r-dimensional hypercube, where 0 ≤ ƒ < r. This system of dipaths constitutes a routing protocol that remains functional in the presence of up to ƒ faults (of nodes and/or links). The problem of constructing such...
One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints
One-machine sequencing with release dates, delivery times and precedence constraints
Online LIB problems : heuristics for bin covering and lower bounds for bin packing
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...
On-Line Waste Management in a Galvanization Plant
Open shop scheduling with delays
Opérateurs positifs et probabilités stationnaires
Optimal age replacement policy of a -out-of- system with age-dependent minimal repair
Optimal and analytical results of queueing model
Optimal and near-optimal () inventory policies for Levy demand processes
Optimal and Near-Optimal (s,S) Inventory Policies for Levy Demand Processes
A Levy jump process is a continuous-time, real-valued stochastic process which has independent and stationary increments, with no Brownian component. We study some of the fundamental properties of Levy jump processes and develop (s,S) inventory models for them. Of particular interest to us is the gamma-distributed Levy process, in which the demand that occurs in a fixed period of time has a gamma distribution. We study the relevant properties of these processes, and we develop a quadratically convergent...
Optimal Batch Production Strategies Under Continuous Price Decrease and Time Discounting
Optimal choice of parameters in machine-time scheduling problems with penalized earliness in starting and lateness in completing the operations
Optimal control and performance analysis of an queue with batches of negative customers
We consider a Markov decision process for an queue that is controlled by batches of negative customers. More specifically, we derive conditions that imply threshold-type optimal policies, under either the total discounted cost criterion or the average cost criterion. The performance analysis of the model when it operates under a given threshold-type policy is also studied. We prove a stability condition and a complete stochastic comparison characterization for models operating under different...
Optimal control and performance analysis of an MX/M/1 queue with batches of negative customers
We consider a Markov decision process for an MX/M/1 queue that is controlled by batches of negative customers. More specifically, we derive conditions that imply threshold-type optimal policies, under either the total discounted cost criterion or the average cost criterion. The performance analysis of the model when it operates under a given threshold-type policy is also studied. We prove a stability condition and a complete stochastic comparison characterization for models operating under different...
Optimal control characteristics of a queueing system with batch services
Optimal control for a BMAP/G/1 queue with two service modes.