Thomas E. Morton

According to our database1, Thomas E. Morton authored at least 17 papers between 1969 and 2007.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
Order acceptance with weighted tardiness.
Comput. Oper. Res., 2007

2006
Aversion scheduling in the presence of risky jobs.
Eur. J. Oper. Res., 2006

1999
Myopic Heuristics for the Random Yield Problem.
Oper. Res., 1999

A Simple Heuristic for Computing Nonstationary (s, S) Policies.
Oper. Res., 1999

Inventory control under speculation: Myopic heuristics and exact procedures.
Eur. J. Oper. Res., 1999

1998
Periodic review stochastic inventory problem with forecast updates: Worst-case bounds for the myopic solution.
Eur. J. Oper. Res., 1998

1996
Selecting jobs for a heavily loaded shop with lateness penalties.
Comput. Oper. Res., 1996

1991
A hybrid heuristic for the facilities layout problem.
Comput. Oper. Res., 1991

1986
Callisto: An Intelligent Project Management System.
AI Mag., 1986

1979
Infinite-Horizon Dynamic Programming Models - A Planning-Horizon Formulation.
Oper. Res., 1979

1978
Universal Planning Horizons for Generalized Convex Production Scheduling.
Oper. Res., 1978

1975
Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results.
Oper. Res., 1975

1974
Decision Horizons in Discrete Time Undiscounted Markov Renewal Programming.
IEEE Trans. Syst. Man Cybern., 1974

1971
The Near-Myopic Nature of the Lagged-Proportional-Cost Inventory Problem with Lost Sales.
Oper. Res., 1971

Technical Note - Undiscounted Markov Renewal Programming Via Modified Successive Approximations.
Oper. Res., 1971

Technical Note - On the Asymptotic Convergence Rate of Cost Differences for Markovian Decision Processes.
Oper. Res., 1971

1969
Letter to the Editor - A Critique of the Norman-White Dynamic Programming Approximation.
Oper. Res., 1969


  Loading...