default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul J. Schweitzer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j27]Jishnu Hazra
, Paul J. Schweitzer, Avi Seidmann:
Throughput and inventory estimation of a pull-based supply system. Int. J. Manuf. Technol. Manag. 5(5/6): 492-506 (2003)- 2002
- [j26]Paolo Cremonesi, Paul J. Schweitzer, Giuseppe Serazzi:
A Unifying Framework for the Approximate Solution of Closed Multiclass Queuing Networks. IEEE Trans. Computers 51(12): 1423-1434 (2002)
1990 – 1999
- 1999
- [j25]Jishnu Hazra, Paul J. Schweitzer, Abraham Seidmann:
Analyzing closed Kanban-controlled assembly systems by iterative aggregation-disaggregation. Comput. Oper. Res. 26(10-11): 1015-1039 (1999) - 1998
- [c5]Paul J. Schweitzer, Giuseppe Serazzi, Marco Broglia:
A Queue-Shift Approximation Technique for Product-Form Queueing. Computer Performance Evaluation (Tools) 1998: 267-279 - 1993
- [c4]Paul J. Schweitzer, Giuseppe Serazzi, Marco Broglia:
A Survey of Bottleneck Analysis in Closed Networks of Queues. Performance/SIGMETRICS Tutorials 1993: 491-508 - 1991
- [j24]Paul J. Schweitzer:
Block-scaling of value-iteration for discounted Markov renewal programming. Ann. Oper. Res. 29(1): 603-630 (1991) - [j23]Paul J. Schweitzer, Ushio Sumita, Katsuhisa Ohno:
Replacement process decomposition for discounted Markov renewal programming. Ann. Oper. Res. 29(1): 631-645 (1991)
1980 – 1989
- 1987
- [c3]Paul J. Schweitzer, Tayfur Altiok:
Aggregate Modelling of Tandem Queues with Blocking. Computer Performance and Reliability 1987: 135-149 - 1985
- [j22]Paul J. Schweitzer, Martin L. Puterman, Kyle W. Kindle:
Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes. Oper. Res. 33(3): 589-605 (1985) - [j21]Paul J. Schweitzer:
Iterative bounds on the relative value vector in undiscounted Markov renewal programming. Z. Oper. Research 29(7): 269-284 (1985) - 1984
- [j20]Paul J. Schweitzer:
A value-iteration scheme for undiscounted multichain Markov renewal programs. Z. Oper. Research 28(5): 143-152 (1984) - [j19]Awi Federgruen, Paul J. Schweitzer:
Successive Approximation Methods for Solving Nested Functional Equations in Markov Decision Problems. Math. Oper. Res. 9(3): 319-344 (1984) - 1983
- [j18]Paul J. Schweitzer, Edward A. Silver:
Technical Note - Mathematical Pitfalls in the One Machine Multiproduct Economic Lot Scheduling Problem. Oper. Res. 31(2): 401-405 (1983) - [j17]Awi Federgruen, Paul J. Schweitzer, Henk C. Tijms:
Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards. Math. Oper. Res. 8(2): 298-313 (1983) - [c2]Paul J. Schweitzer:
Aggregation Methods for Large Markov Chains. Computer Performance and Reliability 1983: 275-286 - 1980
- [j16]Philip M. Merlin, Paul J. Schweitzer:
Deadlock Avoidance in Store-and-Forward Networks-I: Store-and-Forward Deadlock. IEEE Trans. Commun. 28(3): 345-354 (1980) - [j15]Philip M. Merlin, Paul J. Schweitzer:
Deadlock Avoidance in Store-and-Forward Networks-II: Other Deadlock Types. IEEE Trans. Commun. 28(3): 355-360 (1980)
1970 – 1979
- 1978
- [j14]Bezalel Gavish, Paul J. Schweitzer, Eliezer Shlifer:
Assigning buses to schedules in a metropolitan area. Comput. Oper. Res. 5(2): 129-138 (1978) - [j13]Paul J. Schweitzer, Awi Federgruen:
The Functional Equations of Undiscounted Markov Renewal Programming. Math. Oper. Res. 3(4): 308-321 (1978) - [c1]Philip M. Merlin, Paul J. Schweitzer:
Deadlock Avoidance in Store-And-Forward Networks. Jerusalem Conference on Information Technology 1978: 577-581 - 1977
- [j12]Israel Brosh, Eliezer Shlifer, Paul J. Schweitzer:
Generalized Markovian decision processes. Math. Methods Oper. Res. 21(5): 173-186 (1977) - [j11]Paul J. Schweitzer, Awi Federgruen:
The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems. Math. Oper. Res. 2(4): 360-381 (1977) - [j10]Bezalel Gavish, Paul J. Schweitzer, Eliezer Shlifer:
The zero pivot phenomenon in transportation and assignment problems and its computational implications. Math. Program. 12(1): 226-240 (1977) - 1976
- [j9]Paul J. Schweitzer, Simon S. Lam:
Buffer Overflow in a Store-and-Forward Network Node. IBM J. Res. Dev. 20(6): 542-550 (1976) - 1974
- [j8]Paul J. Schweitzer:
Optimization with an approximate Lagrangian. Math. Program. 7(1): 191-198 (1974) - 1972
- [j7]William T. McCormick Jr., Paul J. Schweitzer, Thomas W. White:
Problem Decomposition and Data Reorganization by a Clustering Technique. Oper. Res. 20(5): 993-1009 (1972) - 1971
- [j6]Paul J. Schweitzer:
Technical Note - Threshold Probabilities when Searching for a Moving Target. Oper. Res. 19(3): 707-709 (1971) - [j5]Paul J. Schweitzer:
Multiple Policy Improvements in Undiscounted Markov Renewal Programming. Oper. Res. 19(3): 784-793 (1971)
1960 – 1969
- 1969
- [j4]Paul J. Schweitzer:
Perturbation Theory and Undiscounted Markov Renewal Programming. Oper. Res. 17(4): 716-727 (1969) - 1967
- [j3]Paul J. Schweitzer:
Letter to the Editor - Optimal Replacement Policies for Hyperexponentially and Uniformly Distributed Lifetimes. Oper. Res. 15(2): 360-362 (1967) - [j2]Paul J. Schweitzer:
Initial Provisioning with Spare Deterioration. Oper. Res. 15(3): 513-529 (1967) - 1966
- [j1]Paul J. Schweitzer:
Letter to the Editor - Some Invalid Properties of Markov Chains. Oper. Res. 14(6): 1153-1154 (1966)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
