Country: United States

Found 17049 papers in total
Autonomous agents architectures and algorithms in flexible manufacturing systems
2000,
This paper investigates possible implementations of the autonomous agents concept in...
A workload data aggregation process for flexible manufacturing system modeling using queueing network models
2001,
In this article, we focus on the use of queueing network (QN) models for...
Extended kanban control system: Combining kanban and base stock
2000,
This paper introduces a new mechanism for the coordination of multi-stage...
A simulated annealing approach to mixed-model sequencing with multiple objectives on a just-in-time line
2000,
This paper presents a Simulated Annealing based heuristic that simultaneously...
The extended kanban control system for production coordination of assembly manufacturing systems
2000,
In assembly manufacturing systems there are points in the production process where...
Capacity-constrained reorder intervals for materials requirements planning systems
1997,
This paper develops a model for the reorder interval problem for general production...
Agent-based project scheduling
2000,
Agent technology offers a new way of thinking about many of the classic problems in...
The discrete time/resource trade-off problem in project networks: A branch-and-bound approach
2000,
In many solution methods for resource-constrained project scheduling, it is assumed...
Convergence properties of two-stage stochastic programming
2000,
This paper considers a procedure of two-stage stochastic programming in which the...
Gamma distribution parameter estimation for field reliability data with missing failure times
2000,
Maximum likelihood estimators have been developed for the gamma distribution when...
Constraint exploration method for quadratic programming problem
2000,
In this paper, we represent a method which is based on the violated constraints by the...
Duality bound method for the general quadratic programming problem with quadratic constraints
2000,
The purpose of this article is to develop a branch-and-bound algorithm using duality...
Network decomposition of general financial equilibria with transaction costs
1996,
In this paper, we developed a new general financial equilibrium model with transaction...
Relaxed asynchronous flow-control algorithms for multiclass service networks
2000,
This paper addresses resource sharing in a multiclass service center. The flow of...
Strongly asymptotically optimal design and control of production and service systems
2000,
In this paper we consider production and service systems that can be modeled as single...
Expected move request waiting times in single-device, polling-based material handling systems
2001,
We present an analytical approach to approximate the expected waiting times of move...
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
2000,
Let G = (V, E) be a complete undirected graph with vertex set V, edge set E, and edge...
Another approach for the traveling salesman problem
2000,
In this paper a simple algorithm for finding upper bounds of the solution of the...
Risk intermediation in supply chains
2000,
This paper demonstrates that an important role of intermediaries in supply chains is...
One for the price of two: A unified approach for approximating covering problems
2000,
We present a simple and unified approach for developing and analyzing approximation...
RiskNavô: A decision aid for prioritizing, displaying, and tracking program risk
1998,
This work presents a family of preference models for prioritizing program risk. These...
On the non-autonomous Lotka–Volterra N-species competing systems
2000,
In this paper the qualitative properties of general non-autonomous...
The use of simulation in discrete-event dynamic systems design
2000,
The use of simulation as a tool to design complex stochastic systems is often...
Analysis of scheduling algorithms for master–slave systems
1997,
The master–slave paradigm finds important applications in many industrial...
Papers per page: