Keyword: programming: dynamic

Found 2342 papers in total
Linear time dynamic-programming algorithms for new classes of retricted traveling salesman problems: A computational study
Linear time dynamic-programming algorithms for new classes of retricted traveling salesman problems: A computational study
2001,
Consider the following restricted (symmetric or asymmetric) traveling-salesman problem...
Parallel scheduling of multiclass M/M/c queues: Approximate and heavy-traffic optimization of achievable performance
Parallel scheduling of multiclass M/M/c queues: Approximate and heavy-traffic optimization of achievable performance
2001,
We address the problem of scheduling a multiclass M/M/c queue with Bernoulli feedback...
A Bayesian approach to a dynamic inventory model under an unknown demand distribution
A Bayesian approach to a dynamic inventory model under an unknown demand distribution
2002,
In this paper, the Bayesian approach to demand estimation is outlined for the cases of...
An efficient procedure for non-stationary inventory control
An efficient procedure for non-stationary inventory control
2001,
We present an efficient solution method – Direct Derivative Estimation (DDE)...
Buffer allocation in flow-shop-type production systems with general arrival and service patterns
Buffer allocation in flow-shop-type production systems with general arrival and service patterns
2002,
This study investigates the buffer allocation strategy of a flow-shop-type production...
Scheduling of the optimal tool replacement times in a flexible manufacturing system
Scheduling of the optimal tool replacement times in a flexible manufacturing system
2001,
In Flexible Manufacturing Systems (FMs), a cutting tool is frequently used for...
Single machine batch scheduling with sequential job processing
Single machine batch scheduling with sequential job processing
2001,
The problem of scheduling n jobs on a single machine in batches to minimize some...
A rollout policy for the vehicle routing problem with stochastic demands
A rollout policy for the vehicle routing problem with stochastic demands
2001,
The paper considers the single vehicle routing problem with stochastic demands. While...
The strip cutting/packing problem: Incremental substrip algorithms-based heuristics
The strip cutting/packing problem: Incremental substrip algorithms-based heuristics
1999,
The strip cutting problem consists of cutting a large strip with a fixed-width and...
A decision-support system that helps retailers decide order quantities and markdowns for fashion goods
A decision-support system that helps retailers decide order quantities and markdowns for fashion goods
2001,
We developed MARK, a stochastic dynamic-programming model-based decision-support...
Manufacturing to order with random yield and costly inspection
Manufacturing to order with random yield and costly inspection
2000,
This study considers a situation where a contractor receives an order that it commits...
Managing the impact of high market growth and learning on knowledge worker productivity and service quality
Managing the impact of high market growth and learning on knowledge worker productivity and service quality
2001,
Many high technology firms in the information technology, engineering, and internet...
A time-dependent multiple criteria single-machine scheduling problem
A time-dependent multiple criteria single-machine scheduling problem
2001,
We introduce a nonpreemptive single-machine scheduling model with time-dependent...
Routing order pickers in a warehouse with a middle aisle
Routing order pickers in a warehouse with a middle aisle
2001,
This paper considers a parallel aisle warehouse, where order pickers can change aisles...
Optimal periodic development of a pollution generating tourism industry
Optimal periodic development of a pollution generating tourism industry
2001,
This paper studies how environmental pollution affects optimal development of the...
The resource scheduling in M1+M2/M/N/k system by the ordinal optimization algorithm
The resource scheduling in M1+M2/M/N/k system by the ordinal optimization algorithm
2000,
In the transmission traffic of communication network the buffer resource location for...
Minimization of cell-based handoff delays to balance the load in fiber optic micro-cellular systems
Minimization of cell-based handoff delays to balance the load in fiber optic micro-cellular systems
2001,
This paper considers the scheduling of cell-based handoffs to balance the traffic in a...
Capital budgeting under uncertainty – an integrated approach using contingent claims analysis and integer programming
Capital budgeting under uncertainty – an integrated approach using contingent claims analysis and integer programming
2001,
Recently the application of contingent claims analysis and dynamic programming to...
Hedging derivative securities and incomplete markets: An ε-arbitrage approach
Hedging derivative securities and incomplete markets: An ε-arbitrage approach
2001,
Given a European derivative security with an arbitrary payoff function and a...
Conditional investment policy under uncertainty and irreversibility
Conditional investment policy under uncertainty and irreversibility
2001,
An irreversible investment decision, such as fixing a defective equipment is...
Risk-sensitive control of discrete-time Markov processes with infinite horizon
Risk-sensitive control of discrete-time Markov processes with infinite horizon
1999,
In this paper we study existence of solutions to the Bellman equation corresponding to...
The two-convex-polygons TSP: A solvable case
The two-convex-polygons TSP: A solvable case
1997,
In this paper, the Travelling Salesman Problem when m points are on one convex polygon...
Optimal partitioning of groups in selecting the best choice
Optimal partitioning of groups in selecting the best choice
2001,
This article deals with the group interview problem, in which each group contains...
Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
2001,
In a great many situations, the data for optimization problems cannot be known with...
Papers per page: