Country: United States

Found 17049 papers in total
Transforming renewal processes for simulation of nonstationary arrival processes
Transforming renewal processes for simulation of nonstationary arrival processes
2009,
Simulation models of real-life systems often assume stationary (homogeneous) Poisson...
An algorithm and a core set result for the weighted Euclidean one-center problem
An algorithm and a core set result for the weighted Euclidean one-center problem
2009,
Given a set 𝒜 of m points in n -dimensional space with corresponding positive...
The knowledge-gradient policy for correlated normal beliefs
The knowledge-gradient policy for correlated normal beliefs
2009,
We consider a Bayesian ranking and selection problem with independent normal rewards...
On the integrated production and distribution problem with bidirectional flows
On the integrated production and distribution problem with bidirectional flows
2009,
The integrated production and distribution problem with bidirectional flows is a...
An encoding in metaheuristics for the minimum communication spanning tree problem
An encoding in metaheuristics for the minimum communication spanning tree problem
2009,
Problem-specific encodings can improve the performance of metaheuristics, such as...
An exact method for the minimum cardinality problem in the treatment planning of intensity-modulated radiotherapy
An exact method for the minimum cardinality problem in the treatment planning of intensity-modulated radiotherapy
2009,
In this paper, we introduce an exact method based on constraint programming ideas for...
A constraint programming approach for solving a queueing design and control problem
A constraint programming approach for solving a queueing design and control problem
2009,
A facility with frontroom and backroom operations has the option of hiring specialized...
State-of-the art review–Evolutionary algorithms for vehicle routing
State-of-the art review–Evolutionary algorithms for vehicle routing
2009,
This paper is a survey of the literature on applications of evolutionary algorithms...
Investing in lead-time variability reduction in a quality-adjusted inventory model with finite-range stochastic lead-time
Investing in lead-time variability reduction in a quality-adjusted inventory model with finite-range stochastic lead-time
2008,
We study the impact of the efforts aimed at reducing the lead-time variability in a...
Continuously increasing price in an inventory cycle: An optimal strategy for e-tailers
Continuously increasing price in an inventory cycle: An optimal strategy for e-tailers
2008,
Operations researchers have always assumed that when a product's unit cost is constant...
Determining effective spraying periods to control malaria via indoor residual spraying in Sub-Saharan Africa
Determining effective spraying periods to control malaria via indoor residual spraying in Sub-Saharan Africa
2008,
Indoor residual spraying–spraying insecticide inside houses to kill...
Using different ELECTRE methods in strategic planning in the presence of human behavioral resistance
Using different ELECTRE methods in strategic planning in the presence of human behavioral resistance
2006,
In the multicriteria strategic planning of an organization, management should often be...
Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
2006,
This paper addresses scheduling problems in hybrid flow shop-like systems with a...
A computational approach to pivot selection in the LP relaxation of set problems
A computational approach to pivot selection in the LP relaxation of set problems
2006,
It has long been known to the researchers that choosing a variable having the most...
Student absenteeism in engineering colleges: Evaluation of alternatives using AHP
Student absenteeism in engineering colleges: Evaluation of alternatives using AHP
2006,
The present study illustrates the application of analytical hierarchy process (AHP) to...
Mapping the convergence of genetic algorithms
Mapping the convergence of genetic algorithms
2006,
This paper examines the convergence of genetic algorithms using a...
A simulation framework for networked queue models: Analysis of queue bounds in a G/G/c supply chain
A simulation framework for networked queue models: Analysis of queue bounds in a G/G/c supply chain
2006,
Some limited analytical derivation for networked queue models has been proposed in the...
Synergistic modeling of call center operations
Synergistic modeling of call center operations
2006,
We synergistically apply queueing theory, integer programming, and stochastic...
ACS-TS: train scheduling using ant colony system
ACS-TS: train scheduling using ant colony system
2006,
This paper develops an algorithm for the train scheduling problem using the ant colony...
An effective heuristic for large-scale capacitated facility location problems
An effective heuristic for large-scale capacitated facility location problems
2009,
The Capacitated Facility Location Problem ( CFLP ) consists of locating a set of...
Evolutionary multiobjective optimization in noisy problem environments
Evolutionary multiobjective optimization in noisy problem environments
2009,
This paper presents a multiobjective evolutionary algorithm (MOEA) capable of handling...
Using scenario trees and progressive hedging for stochastic inventory routing problems
Using scenario trees and progressive hedging for stochastic inventory routing problems
2009,
The Stochastic Inventory Routing Problem is a challenging problem, combining inventory...
A stable primal–dual approach for linear programming under nondegeneracy assumptions
A stable primal–dual approach for linear programming under nondegeneracy assumptions
2009,
This paper studies a primal–dual interior/exterior-point path-following approach...
Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
2009,
The purpose of the traffic assignment problem is to obtain a traffic flow pattern...
Papers per page: