Bean James C.

James C. Bean

Information about the author James C. Bean will soon be added to the site.
Found 17 papers in total
Convergence in probability of compressed annealing
Convergence in probability of compressed annealing
2004
We consider combinatorial optimization problems for which the formation of a...
A hybrid genetic/optimization algorithm for finite-horizon, partially observed Markov decision processes
A hybrid genetic/optimization algorithm for finite-horizon, partially observed Markov decision processes
2004
The partially observed Markov decision process (POMDP) is a generalization of a Markov...
A hybrid genetic/optimization algorithm for a task allocation problem
A hybrid genetic/optimization algorithm for a task allocation problem
1999
We consider the problem of designing a distributed computing system for handling a set...
A genetic algorithm methodology for complex scheduling problems
A genetic algorithm methodology for complex scheduling problems
1999
This paper considers the scheduling problem to minimize total tardiness given multiple...
Genetic algorithms and random keys for sequencing and optimization
Genetic algorithms and random keys for sequencing and optimization
1994
In this paper we present a general genetic algorithm to address a wide variety of...
Conditions for the discovery of solution horizons
Conditions for the discovery of solution horizons
1993
The authors present necessary and sufficient conditions for discrete infinite horizon...
Parallel replacement under capital rationing constraints
Parallel replacement under capital rationing constraints
1994
Contrary to serial replacement, parallel replacement problems require a decision maker...
Equipment replacement under technological change
Equipment replacement under technological change
1994
For infinite-horizon replacement economy problems it is common practice to truncate...
A stopping rule for forecast horizons in nonhomogeneous Markov decision processes
A stopping rule for forecast horizons in nonhomogeneous Markov decision processes
1992
The authors formulate a mixed integer program to determine whether a finite time...
A Lagrangian based approach for the asymmetric Generalized Traveling Salesman Problem
A Lagrangian based approach for the asymmetric Generalized Traveling Salesman Problem
1991
This paper presents an optimal approach for the asymmetric Generalized Traveling...
An efficient transformation of the Generalized Traveling Salesman Problem
An efficient transformation of the Generalized Traveling Salesman Problem
1993
The Generalized Traveling Salesman Problem (GTSP) is a useful model for problems...
Matchup scheduling with multiple resources, release dates and disruptions
Matchup scheduling with multiple resources, release dates and disruptions
1991
This paper considers the rescheduling of operations with release dates and multiple...
Capacity expansion under stochastic demands
Capacity expansion under stochastic demands
1992
The authors consider the problem of optimally meeting a stochastically growing demand...
Duality in infinite dimensional linear programming
Duality in infinite dimensional linear programming
1992
The authors consider the class of linear programs with infinitely many variables and...
A tie-breaking rule for discrete infinite horizon optimization
A tie-breaking rule for discrete infinite horizon optimization
1992
The authors study discrete infinite horizon optimization problems without the common...
Deterministic equivalence in stochastic infinite horizon problems
Deterministic equivalence in stochastic infinite horizon problems
1990
The authors consider a general infinite horizon problem with stochastic data. They...
Degeneracy in infinite horizon optimization
Degeneracy in infinite horizon optimization
1989
The authors consider sequential decision problems over an infinite horizon. The...
Papers per page: