Zobrazeno 1 - 10
of 11
pro vyhledávání: '"David Y. Burman"'
Autor:
Ke-Tsai Edward Chin, Kaveh Hushyar, Robert D. Storrs, David Y. Burman, John Huber, Gerald M. Barr, Barbara A. Binder
Publikováno v:
AT&T Technical Journal. 69:81-89
The interval for execution of a parts pick list in the AT&T Denver Works storeroom has been shortened from 1 week to 2 days or less — often as little as 2 hours. This has been achieved without costly automated storage retrieval systems. Instead, st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e4482984f891820af062fe09b59a53a
https://doi.org/10.1002/j.1538-7305.1990.tb00113.x
https://doi.org/10.1002/j.1538-7305.1990.tb00113.x
Autor:
Ardavan Nozari, Joseph P. Sitarik, F. Javier Gurrola-Gal, David Y. Burman, Shashikant Sathaye
Publikováno v:
AT&T Technical Journal. 65:46-57
This paper discusses ways that operations research tools and techniques can be used to analyze the performance of integrated circuit manufacturing lines. It focuses on simulation, queueing, and deterministic capacity models and, through case studies,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cbfaf3b31bbed95f982ff9adae99190
https://doi.org/10.1002/j.1538-7305.1986.tb00465.x
https://doi.org/10.1002/j.1538-7305.1986.tb00465.x
Autor:
Donald R. Smith, David Y. Burman
Publikováno v:
Bell System Technical Journal. 62:1433-1453
Assuming a particular model for “bursty” traffic at a packet-switching node, we find expressions for the expected delay of packets that are valid in light and heavy traffic. Each expression consists of a “correction factor” multiplied by the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56b3ef04b0e210c8276b104ff2bdccc8
https://doi.org/10.1002/j.1538-7305.1983.tb03490.x
https://doi.org/10.1002/j.1538-7305.1983.tb03490.x
Autor:
David Y. Burman, Donald R. Smith
Publikováno v:
Mathematics of Operations Research. 8:15-25
Several approximations for the expected delay in an M/G/c queue depend on both its light- and heavy-traffic behavior. Although the required heavy-traffic result has been proved, the light-traffic result has only been conjectured by Boxma, Cohen, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c9a5bc16bf56dde02bb6a97c65139e8
https://doi.org/10.1287/moor.8.1.15
https://doi.org/10.1287/moor.8.1.15
Autor:
Donald R. Smith, David Y. Burman
Publikováno v:
Operations Research. 34:105-119
We study the mean delay and the mean number in queue in a single-server system whose arrivals are given by a nonhomogeneous Poisson process with rate equal to a function of the state of an independent Markov process. Models of this sort arise natural
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21f67b747333ce55ba785f7c9622bd9f
https://doi.org/10.1287/opre.34.1.105
https://doi.org/10.1287/opre.34.1.105
Autor:
David Y. Burman
Publikováno v:
Advances in Applied Probability. 13:846-859
It is well known that the stationary distribution of the number of busy servers in the Erlang blocking system (MIG/cIc) depends on the service-time distribution only through its mean. This insensitivity property is shared by several other queueing sy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1d8ffb366304360f97575b831d930b7
https://doi.org/10.2307/1426976
https://doi.org/10.2307/1426976
Publikováno v:
Journal of Manufacturing Systems. 5:217-222
It has been demonstrated that several performance measures (e.g., expected delay and number in the system) improve when n servers take customers from a single queue rather than from n separate queues dedicated to individual servers. In this paper, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ec9ad30c0b78413134cad34693c156f
https://doi.org/10.1016/0278-6125(86)90052-x
https://doi.org/10.1016/0278-6125(86)90052-x
Autor:
John A. Buzacott, Richard L. Tweedie, John S. Baras, Elja Arjas, Marcel F. Neuts, A. J. Dorsey, Jagadeesh Chandramohan, Arnold Greenland, Kyung Y. Jo, Armand M. Makowski, David D. Yao, Jos H. A. De Smit, Pentti Haara, David Y. Burman, Ralph L. Disney, Donald R. Smith, P. Reeser, William A. Massey
Publikováno v:
Advances in Applied Probability. 16:6-6
Consider a general single-server queue where the customers arrive according to a Poisson process whose rate is modulated according to an independent Markov process. The authors have previously reported on limits for the average delay in light and hea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::481af3be56b2f36481e83e62fee675d6
https://doi.org/10.2307/1427217
https://doi.org/10.2307/1427217
Autor:
David Y. Burman, Donald R. Smith
Publikováno v:
Advances in Applied Probability. 16:6
Consider a general single-server queue where the customers arrive according to a Poisson process whose rate is modulated according to an independent Markov process. The authors have previously reported on limits for the average delay in light and hea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8de2b03b73fbec9b148e30c5b4a41cb4
https://doi.org/10.1017/s0001867800021820
https://doi.org/10.1017/s0001867800021820
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.