Journal: Operations Research Letters

Found 1763 papers in total
Selecting among scheduled projects
Selecting among scheduled projects
1995,
The authors demonstrate a rule for optimally selecting m among n scheduled projects...
Lot sizing in a no-wait flow shop
Lot sizing in a no-wait flow shop
1995,
The authors consider a no-wait flow shop which manufactures large numbers of copies of...
Units invariant and translation invariant data envelopment analysis models
Units invariant and translation invariant data envelopment analysis models
1995,
In this paper the authors discuss the desirable properties of units invariance and...
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
1994,
Facet-defining inequalities lifted from minimal covers are used as strong cutting...
Reliability, covering and balanced matrices
Reliability, covering and balanced matrices
1995,
This paper addresses a certain generalized covering integer program. The original...
An exact algorithm for the dual bin packing problem
An exact algorithm for the dual bin packing problem
1995,
In the Dual Bin Packing Problem (DBP), there is an unlimited number of bins of...
Condition numbers for polyhedra with real number data
Condition numbers for polyhedra with real number data
1995,
The authors consider the complexity of finding a feasible point inside a polyhedron...
A generalized homogeneous and self-dual algorithm for linear programming
A generalized homogeneous and self-dual algorithm for linear programming
1995,
A generalized homogeneous and self-dual infeasible-interior-point algorithm for linear...
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
1995,
The authors develop a framework for characterizing classes of facets for the Boolean...
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
1995,
A decomposition branch and bound approach is considered for the global minimization of...
Stochastic inequalities for M/G/1 retrial queues
Stochastic inequalities for M/G/1 retrial queues
1994,
Consider an M/G/1 retrial queue. The performance characteristics of such a system are...
Equilibrium strategies for queues with impatient customers
Equilibrium strategies for queues with impatient customers
1995,
The authors consider a memoryless queue in which the reward of service completion for...
Monotone effect of dependency between interarrival and service times in a simple queueing system
Monotone effect of dependency between interarrival and service times in a simple queueing system
1995,
Most practical queueing systems have dependencies between arrival and service...
A queueing system with returning customers and waiting line
A queueing system with returning customers and waiting line
1995,
The paper considers a queueing system where a customer who finds all channels busy...
A comparison of frequency domain methodology and conventional factor screening methods
A comparison of frequency domain methodology and conventional factor screening methods
1995,
This paper presents a large sample comparison of two techniques in computer simulation...
Monge matrices make maximization manageable
Monge matrices make maximization manageable
1994,
The authors continue the research on the effects of Monge structures in the area of...
On the convergence of descent metods for monotone variational inequalities
On the convergence of descent metods for monotone variational inequalities
1994,
Recently, Zhu and Marcotte established the convergence of a modified descent algorithm...
Networks of queues with batch services, signals and product form solutions
Networks of queues with batch services, signals and product form solutions
1995,
Consider a network of queues with batch services at each node and signals. The nodes...
On continuous network flows
On continuous network flows
1995,
This work addresses two problems concerning continuous dynamic flows. A model is...
Multiterminal flows and cuts
Multiterminal flows and cuts
1995,
Gomory and Hu studied minimal collections of cuts in a graph that contain a min cut...
The network synthesis problem in a cycle
The network synthesis problem in a cycle
1995,
The network synthesis problem is to design an undirected network with a minimum total...
Categorized bottleneck-Minisum path problems on networks
Categorized bottleneck-Minisum path problems on networks
1994,
The authors introduce two path problems on a network, where edges of the network are...
Assembly at system level versus component level
Assembly at system level versus component level
1995,
Given two system structure functions F and G , the authors consider the assemblage of...
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
1995,
The authors prove that the bicriteria single-machine scheduling problem of minimizing...
Papers per page: