Paul J. Schweitzer

According to our database1, Paul J. Schweitzer authored at least 32 papers between 1966 and 2003.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2003
Throughput and inventory estimation of a pull-based supply system.
Int. J. Manuf. Technol. Manag., 2003

2002
A Unifying Framework for the Approximate Solution of Closed Multiclass Queuing Networks.
IEEE Trans. Computers, 2002

1999
Analyzing closed Kanban-controlled assembly systems by iterative aggregation-disaggregation.
Comput. Oper. Res., 1999

1998
A Queue-Shift Approximation Technique for Product-Form Queueing.
Proceedings of the Computer Performance Evaluation: Modelling Techniques and Tools, 1998

1993
A Survey of Bottleneck Analysis in Closed Networks of Queues.
Proceedings of the Performance Evaluation of Computer and Communication Systems, 1993

1991
Replacement process decomposition for discounted Markov renewal programming.
Ann. Oper. Res., 1991

Block-scaling of value-iteration for discounted Markov renewal programming.
Ann. Oper. Res., 1991

1987
Aggregate Modelling of Tandem Queues with Blocking.
Proceedings of the Computer Performance and Reliability, 1987

1985
Iterative bounds on the relative value vector in undiscounted Markov renewal programming.
Z. Oper. Research, 1985

Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes.
Oper. Res., 1985

1984
Successive Approximation Methods for Solving Nested Functional Equations in Markov Decision Problems.
Math. Oper. Res., 1984

A value-iteration scheme for undiscounted multichain Markov renewal programs.
Z. Oper. Research, 1984

1983
Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards.
Math. Oper. Res., 1983

Technical Note - Mathematical Pitfalls in the One Machine Multiproduct Economic Lot Scheduling Problem.
Oper. Res., 1983

Aggregation Methods for Large Markov Chains.
Proceedings of the Computer Performance and Reliability, 1983

1980
Deadlock Avoidance in Store-and-Forward Networks-II: Other Deadlock Types.
IEEE Trans. Commun., 1980

Deadlock Avoidance in Store-and-Forward Networks-I: Store-and-Forward Deadlock.
IEEE Trans. Commun., 1980

1978
The Functional Equations of Undiscounted Markov Renewal Programming.
Math. Oper. Res., 1978

Assigning buses to schedules in a metropolitan area.
Comput. Oper. Res., 1978

Deadlock Avoidance in Store-And-Forward Networks.
Proceedings of the Information Technology '78: Proceedings of the 3rd Jerusalem Conference on Information Technology (JCIT3), 1978

1977
The zero pivot phenomenon in transportation and assignment problems and its computational implications.
Math. Program., 1977

The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems.
Math. Oper. Res., 1977

Generalized Markovian decision processes.
Math. Methods Oper. Res., 1977

1976
Buffer Overflow in a Store-and-Forward Network Node.
IBM J. Res. Dev., 1976

1974
Optimization with an approximate Lagrangian.
Math. Program., 1974

1972
Problem Decomposition and Data Reorganization by a Clustering Technique.
Oper. Res., 1972

1971
Multiple Policy Improvements in Undiscounted Markov Renewal Programming.
Oper. Res., 1971

Technical Note - Threshold Probabilities when Searching for a Moving Target.
Oper. Res., 1971

1969
Perturbation Theory and Undiscounted Markov Renewal Programming.
Oper. Res., 1969

1967
Initial Provisioning with Spare Deterioration.
Oper. Res., 1967

Letter to the Editor - Optimal Replacement Policies for Hyperexponentially and Uniformly Distributed Lifetimes.
Oper. Res., 1967

1966
Letter to the Editor - Some Invalid Properties of Markov Chains.
Oper. Res., 1966


  Loading...