The following pages link to Thomas E. Morton (Q595500):
Displaying 40 items.
- A forward algorithm and planning horizon procedure for the production smoothing problem without inventory (Q595502) (← links)
- Order acceptance with weighted tardiness (Q878579) (← links)
- (Q1097829) (redirect page) (← links)
- Planning horizons for capacity expansion (Q1097830) (← links)
- `Aversion dynamics' scheduling when the system changes (Q1567297) (← links)
- Periodic review stochastic inventory problem with forecast updates: Worst-case bounds for the myopic solution (Q1806820) (← links)
- Inventory control under speculation: Myopic heuristics and exact procedures (Q1847164) (← links)
- A hybrid heuristic for the facilities layout problem (Q2276871) (← links)
- Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics (Q2366078) (← links)
- Aversion scheduling in the presence of risky jobs (Q2432856) (← links)
- Selecting jobs for heavily loaded shop with lateness penalties (Q2563886) (← links)
- Capacity Expansion and Replacement in Growing Markets with Uncertain Technological Breakthroughs (Q2783912) (← links)
- Universal Planning Horizons for Generalized Convex Production Scheduling (Q3206643) (← links)
- Minimal forecast horizon procedures for dynamic lot size models (Q3724051) (← links)
- A Forward Simplex Method for Staircase Linear Programs (Q3750519) (← links)
- The Single Machine Early/Tardy Problem (Q3818793) (← links)
- Infinite-Horizon Dynamic Programming Models—A Planning-Horizon Formulation (Q3851990) (← links)
- A Perfect Planning Horizon Procedure for a Deterministic Cash Balance Problem (Q3944335) (← links)
- The Nonstationary Infinite Horizon Inventory Problem (Q3955129) (← links)
- Optimal Funding Paths for a Class of Risky R&D Projects (Q4066828) (← links)
- Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results (Q4079305) (← links)
- Bounds on Absorption Probabilities for the m-Dimensional Random Walk (Q4117188) (← links)
- Planning Horizons for Production Smoothing with Deterministic Demands (Q4124585) (← links)
- General Planning Horizons for Production Smoothing with Deterministic Demands (Q4124586) (← links)
- Discounting, Ergodicity and Convergence for Markov Decision Processes (Q4132287) (← links)
- Note—An Improved Algorithm for the Stationary Cost Dynamic Lot Size Model with Backlogging (Q4160664) (← links)
- Protective Planning-Horizon Procedures for a Deterministic Cash Balance Problem (Q4166541) (← links)
- Algoristics for Single-Machine Sequencing with Precedence Constraints (Q4173171) (← links)
- Near Myopic Heuristics for the Fixed-Life Perishability Problem (Q4282288) (← links)
- A Periodic Review, Production Planning Model with Uncertain Capacity and Uncertain Demand—Optimality of Extended Myopic Policies (Q4302650) (← links)
- Decision Horizons in Discrete Time Undiscounted Markov Renewal Programming (Q4404692) (← links)
- A Simple Heuristic for Computing Nonstationary (s, S) Policies (Q4545665) (← links)
- The Finite Horizon Nonstationary Stochastic Inventory Problem: Near-Myopic Bounds, Heuristics, Testing (Q4849347) (← links)
- The Nonstationary Stochastic Lead-Time Inventory Problem: Near-Myopic Bounds, Heuristics, and Testing (Q4887778) (← links)
- Myopic Heuristics for the Random Yield Problem (Q4950817) (← links)
- Letter to the Editor—A Critique of the Norman-White Dynamic Programming Approximation (Q5568937) (← links)
- Technical Note—On the Asymptotic Convergence Rate of Cost Differences for Markovian Decision Processes (Q5619732) (← links)
- Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations (Q5624999) (← links)
- The Near-Myopic Nature of the Lagged-Proportional-Cost Inventory Problem with Lost Sales (Q5632333) (← links)
- A mixed optimization technique for the generalized machine replacement problem (Q5671762) (← links)
