default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward P. C. Kao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1999
[j19]Edward P. C. Kao, Sandra D. Wilson:
Analysis of nonpreemptive priority queues with multiple servers and two priority classes. Eur. J. Oper. Res. 118(1): 181-193 (1999)- 1996
- [j18]Edward P. C. Kao:
A Comparison of Alternative Approaches for Numerical Solutions of GI/PH/1 Queues. INFORMS J. Comput. 8(1): 74-85 (1996) - 1992
- [j17]Edward P. C. Kao:
Using state reduction for computing steady state vectors in Markov chains ofM/G/1 type. Queueing Syst. Theory Appl. 10(1-2): 89-104 (1992) - 1991
- [j16]Edward P. C. Kao:
Using State Reduction for Computing Steady State Probabilities of Queues of GI/PH/1 Types. INFORMS J. Comput. 3(3): 231-240 (1991) - [j15]Prawit Ittimakin, Edward P. C. Kao:
Stationary Waiting Time Distribution of a Queue in Which Customers Require a Random Number of Servers. Oper. Res. 39(4): 633-638 (1991) - 1990
- [j14]Edward P. C. Kao, Kumar S. Narayanan:
Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue. INFORMS J. Comput. 2(3): 211-218 (1990) - 1982
- [j13]Edward P. C. Kao, Maurice Queyranne:
On Dynamic Programming Methods for Assembly Line Balancing. Oper. Res. 30(2): 375-390 (1982) - 1981
- [j12]Edward P. C. Kao:
Erratum and comments on computational experience with a stochastic assembly line balancing algorithm : Comput. & Ops Res. 6(2), 79-86, 1979. Comput. Oper. Res. 8(1): 58 (1981) - [j11]Edward P. C. Kao:
Errata. Oper. Res. 29(6): 1238 (1981) - 1980
- [j10]Edward P. C. Kao:
A multiple objective decision theoretic approach to one-machine scheduling problems. Comput. Oper. Res. 7(4): 251-259 (1980) - [j9]Edward P. C. Kao, Michael Brown:
Simulating a Computer System for Processing Electrocardiograms. IEEE Trans. Syst. Man Cybern. 10(6): 297-303 (1980) - 1979
- [j8]Edward P. C. Kao:
Computational experience with a stochastic assembly line balancing algorithm. Comput. Oper. Res. 6(2): 79-86 (1979) - [j7]Edward P. C. Kao:
A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs. Oper. Res. 27(2): 279-289 (1979) - 1978
- [j6]Edward P. C. Kao:
A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem. Oper. Res. 26(6): 1033-1045 (1978) - 1975
- [j5]Edward P. C. Kao:
A Discrete Time Inventory Model with Arbitrary Interval and Quantity Distributions of Demand. Oper. Res. 23(6): 1131-1142 (1975) - 1974
- [j4]Edward P. C. Kao:
Modeling the Movement of Coronary Patients within a Hospital by Semi-Markov Processes. Oper. Res. 22(4): 683-699 (1974) - [j3]Edward P. C. Kao:
Study of Patient Admission Policies for Specialized Care Facilities. IEEE Trans. Syst. Man Cybern. 4(6): 505-512 (1974) - 1973
- [j2]Edward P. C. Kao:
Optimal Replacement Rules when Changes of State are Semi-Markovian. Oper. Res. 21(6): 1231-1249 (1973) - [j1]Edward P. C. Kao:
A Semi-Markovian Population Model with Application to Hospital Planning. IEEE Trans. Syst. Man Cybern. 3(4): 327-336 (1973)
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-24 23:17 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:
