The following pages link to James Flynn (Q224392):
Displayed 40 items.
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
- A single-period inventory placement problem for a supply chain with the expected profit objective (Q859689) (← links)
- Optimal steady states, excessive functions, and deterministic dynamic programs (Q912004) (← links)
- The newsvendor problem with an in-season price adjustment (Q1027600) (← links)
- On fractional flow models and equivalent finite state processes (Q1106740) (← links)
- Optimal replacement policies for a multicomponent reliability system (Q1111464) (← links)
- On optimality criteria for dynamic programs with long finite horizons (Q1142160) (← links)
- Computing efficient steady state policies for deterministic dynamic programs. I (Q1191780) (← links)
- Conditions for the equivalence of optimality criteria in dynamic programming (Q1235681) (← links)
- Computing efficient steady state policies for deterministic dynamic programs. II (Q1260897) (← links)
- An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
- Averaging vs. discounting in dynamic programming: a counterexample (Q1393717) (← links)
- A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems (Q1885986) (← links)
- A single-period inventory placement problem for a supply system with the satisficing objective (Q2253460) (← links)
- An effective heuristic for the review period in an inventory model with staggered deliveries and normal demands (Q2462159) (← links)
- A multi-item newsvendor problem with preseason production and capacitated reactive production (Q2475819) (← links)
- Selecting review periods for a coordinated multi-item inventory model with staggered deliveries (Q2781044) (← links)
- (Q3213775) (← links)
- A Dynamic Programming Model of Fractional Flows with Application to Maintenance and Replacement Problems (Q3325497) (← links)
- Optimal replacement policies for k-out-of-n systems (Q3478241) (← links)
- An Algorithm for a Dynamic Programming Model of Fractional Flows (Q3818818) (← links)
- The Existence of Optimal Invariant Stocks in a Multi-Sector Economy (Q3887171) (← links)
- Steady State Policies for Deterministic Dynamic Programs (Q3894541) (← links)
- (Q3910340) (← links)
- Steady State Policies for a Class of Deterministic Dynamic Programming Models (Q4046660) (← links)
- Retaining Productive Units: A Dynamic Programming Model with a Steady State Solution (Q4070989) (← links)
- (Q4071046) (← links)
- (Q4150767) (← links)
- A heuristic algorithm for determining replacement policies ink-out-of-n systems (Q4367300) (← links)
- The Optimal Review Period in a Dynamic Inventory Model (Q4393121) (← links)
- (Q4488783) (← links)
- A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems (Q4533475) (← links)
- A single-period inventory placement problem for a serial supply chain (Q4544220) (← links)
- A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in <i>K</i>-Out-of-<i>N</i> Systems (Q4868802) (← links)
- A Dynamic Inventory Model with Periodic Auditing (Q5202002) (← links)
- (Q5645238) (← links)
- Some Results on Max-Min Pursuit (Q5655220) (← links)
- Lion and Man: The General Case (Q5668277) (← links)
- Lion and Man: The Boundary Constraint (Q5675172) (← links)
- A newsboy problem with reactive production (Q5953165) (← links)