Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: United States
Found
17049 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
On inventory abatement via manufacturing randomness reductions
1998,
Arreola-Risa A.
Under a continuous improvement framework, the policy of abating inventory via...
Simplifying optimal strategies in stochastic games
1998,
Vrieze O.J.
We deal with zero-sum limiting average stochastic games. We show that the existence of...
Supply-chain synchronization: Lessons from Hyundai Motor Company
2000,
Hahn Chan K.
One of the challenges of supply-chain management is developing ways to effectively...
Using branch-and-price-and-cut to solve origin–destination integer multicommodity flow problems
2000,
Barnhart Cynthia
We present a column-generation model and branch-and-price-and-cut algorithm for...
A O(nm log(U/n)) time maximum flow algorithm
2000,
Sedeo-Noda Antonio
In this paper, we present an O ( nm log( U/n )) time maximum flow algorithm. If U...
A dynamic network flow problem with uncertain arc capacities: Formulation and problem structure
2000,
Nemhauser George L.
We consider a dynamic network flow problem where the arc capacities are random...
A polynomial-time approximation scheme for minimum routing cost spanning trees
2000,
Ravi R.
Given an undirected graph with nonnegative costs on the edges, the routing cost of any...
Performance analysis of an assembly station with input from multiple fabrication lines
2000,
Suri Rajan
We develop analytical models for performance evaluation of Fabrication/Assembly (F/A)...
Tandem configuration automated guided vehicle systems: A comparative study
1996,
Mosier C.T.
Automated guided vehicle (AGV) systems provide the flexibility and integration...
Restless bandits, linear programming relaxations, and a primal–dual index heuristic
2000,
Bertsimas Dimitris
We develop a mathematical programming approach for the classical PSPACE-hard restless...
Probabilistic analysis of renewal cycles: An application to a non-Markovian inventory problem with multiple objectives
2000,
Parlar Mahmut
Many stochastic optimization problems are solved using the renewal reward theorem...
Planned lead times in multistage systems
1998,
Ritzman L.P.
This study investigates the impact of planned lead times on performance in multistage...
Sliding modes in solving convex programming problems
1998,
Glazos M.P.
Sliding modes are used to analyze a class of dynamical systems that solve convex...
Managing the international strategic sourcing process as a market-driven organizational learning system
1998,
Hult G.T.M.
This study examines the effects of market-driven organizational learning on a select...
Finite horizon stochastic knapsacks with applications to yield management
2000,
Slyke Richard van
The finite horizon stochastic knapsack combines a secretary problem with an integer...
The value of using scheduling information in planning material requirements
1998,
Kanet J.J.
Current research and practice in the field of production and inventory planning is...
Optimality of myopic ordering policies for inventory model with stochastic supply
2000,
Fujiwara Okitsugu
This paper addresses a discrete time inventory model where the maximum amount of...
Limits to concurrency
1999,
Hoedemaker G.M.
In the global race to bring new products to market, many firms have adopted concurrent...
Monotone optimal policies for a transient queueing staffing problem
2000,
Fu Michael C.
We consider the problem of determining the optimal policy for staffing a queueing...
Unification of robust design and goal programming for multiresponse optimization – a case study
1997,
Babu A.S.
Fixing the levels of input process parameters to meet a required specification of...
Advanced Models for Project Management
2000,
Barros Lilian L.
Heuristic and exact algorithms for the precedence-constrained knapsack problem
2000,
Yamada T.
The knapsack problem (KP) is generalized taking into account a precedence relation...
On Dantzig–Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
2000,
Vanderbeck Franois
Dantzig–Wolfe decomposition as applied to an integer program is a specific form...
A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
2000,
Holmberg Kaj
The capacitated network design problem is a multicommodity minimal cost network flow...
First Page
347
348
349
350
351
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers