{"id":239,"date":"2021-03-19T14:37:14","date_gmt":"2021-03-19T05:37:14","guid":{"rendered":"https:\/\/orsj.org\/queue\/?page_id=239"},"modified":"2021-03-19T14:37:14","modified_gmt":"2021-03-19T05:37:14","slug":"quesym1991","status":"publish","type":"page","link":"https:\/\/orsj.org\/queue\/symposium\/quesym_history\/quesym1991\/","title":{"rendered":"1991\u5e74\u5ea6(\u7b2c10\u56de)\u5f85\u3061\u884c\u5217\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0"},"content":{"rendered":"<p>    <center><\/p>\n<h2>1991\u5e74\u5ea6\uff08\u7b2c10\u56de\uff09\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0<br \/>\n      &#8220;\u60c5\u5831\u30fb\u901a\u4fe1\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306b\u95a2\u3059\u308b\u5f85\u3061\u884c\u5217\u30e2\u30c7\u30eb\u306e\u7dcf\u5408\u7684\u7814\u7a76&#8221;<\/h2>\n<p>      \u65e5\u6642: 1992\u5e741\u670823-25\u65e5<br \/>\n      \u5834\u6240: \u6d5c\u677e\u30fb\u6d5c\u540d\u8358<br \/>\n      \u79d1\u5b66\u7814\u7a76\u8cbb\u88dc\u52a9\u91d1 \u7dcf\u5408\u7814\u7a76 (A), \u8ab2\u984c\u756a\u53f7 02302085<br \/>\n      \u7814\u7a76\u4ee3\u8868\u8005: \u68ee \u96c5\u592b\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09<br \/>\n    <\/center><\/p>\n<hr>\n<ul>\n<li>Cross Aggregation Method \u306b\u304a\u3051\u308b\u8fd1\u4f3c\u7cbe\u5ea6\u306e\u6bd4\u8f03<br \/>\n\t<br \/>\u5b8b \u5b87, \u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>MMPP\u5165\u529b\u5f85\u3061\u884c\u5217\u30e2\u30c7\u30eb\u306e\u6570\u5024\u89e3\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u305d\u306e\u5fdc\u7528<br \/>\n\t<br \/>\u9006\u702c\u5ddd \u6d69\u5b5d\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Optimal Order Problem for Two Servers in Tandem with Blocking<br \/>\n\t<br \/>\u5c71\u5d0e \u6e90\u6cbb\uff08\u6771\u4eac\u90fd\u7acb\u79d1\u5b66\u6280\u8853\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u6709\u9650\u30d0\u30c3\u30d5\u30a1\u7570\u7a2e\u4e26\u5217\u5f85\u3061\u884c\u5217\u306b\u304a\u3051\u308b\u6700\u9069\u5236\u5fa1\u5247\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u4e2d\u51fa \u5eb7\u4e00, \u5927\u91ce \u52dd\u4e45\uff08\u540d\u53e4\u5c4b\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Optimal Scheduling for Multiple Servers Queueing Systems with Customer Deadlines<br \/>\n\t<br \/>\u91d1\u5c71 \u9054\u592b\uff08NTT\uff09, \u5927\u897f \u5321\u5149, \u8328\u6728 \u4fca\u79c0\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u5ba2\u7a2e\u3092\u8003\u616e\u3057\u305fPH-MRP\/M(n)\/1\u5f85\u3061\u884c\u5217<br \/>\n\t<br \/>\u7530\u6751 \u9686\u5584, \u4e2d\u51fa \u5eb7\u4e00, \u5927\u91ce \u52dd\u4e45\uff08\u540d\u53e4\u5c4b\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u6d41\u4f53\u30e2\u30c7\u30eb\u306b\u3088\u308b\u901a\u4fe1\u7db2\u3075\u304f\u305d\u3046\u306e\u89e3\u6790<br \/>\n\t<br \/>\u592a\u7530 \u6b63\u5b5d\uff08\u9ad8\u5ea6\u901a\u4fe1\u30b7\u30b9\u30c6\u30e0\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u62e1\u5f35\u6027\u3092\u91cd\u8996\u3057\u305f\u5f85\u884c\u5217\u7db2\u30b7\u30df\u30e5\u30ec\u30fc\u30bf<br \/>\n\t<br \/>\u4eca\u91ce \u5b8f, \u85e4\u539f \u7766\uff08\u6771\u829d\u30b7\u30b9\u30c6\u30e0\u30bd\u30d5\u30c8\u30a6\u30a7\u30a2\u6280\u8853\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u76f8\u95a2\u306e\u3042\u308b\u8aa4\u308a\u30c1\u30e3\u30cd\u30eb\u306b\u304a\u3051\u308bGo-back-N ARQ \u65b9\u5f0f\u306e\u6027\u80fd\u89e3\u6790<br \/>\n\t<br \/>\u6797\u7530 \u884c\u96c4\uff08\u4f50\u8cc0\u5927\u5b66\uff09, \u5c0f\u677e \u96c5\u6cbb\uff08\u5927\u962a\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Buffer Allocation Problem for Feed-Forward Open Queueing Networks<br \/>\n\t<br \/>\u5c71\u4e0b \u82f1\u660e\uff08\u4e0a\u667a\u5927\u5b66\uff09, Raif O\uff0eOnvural\uff08IBM\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u8907\u6570\u7aef\u672b\u6a5f-\u8907\u6570\u8a08\u7b97\u6a5f\u7fa4\u30b7\u30b9\u30c6\u30e0\u306e\u6027\u80fd\u89e3\u6790<br \/>\n\t<br \/>\u85e4\u6a4b \u5fe0\u609f\uff08\u6771\u4eac\u5de5\u82b8\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>The Stationary Work in System of a G\/G\/1 Gradual Input Queue<br \/>\n\t<br \/>\u7d00 \u4e00\u8aa0\uff08\u65e5\u672c\u96fb\u6c17C\uff06C\u60c5\u5831\u7814\u7a76\u6240\uff09, \u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A Simple Method of Estimating Mean Sojourn Time of the M\/G\/1 Queue by Counting Arrivals and Departures<br \/>\n\t<br \/>\u8c4a\u6cc9 \u6d0b\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30e9\u30b2\u30fc\u30eb\u5909\u63db\u6cd5\u3092\u3082\u3061\u3044\u305f\u30d0\u30fc\u30b9\u30c8\u5165\u529b\u5f85\u3061\u884c\u5217\u30e2\u30c7\u30eb\u306e\u904e\u6e21\u89e3\u6790<br \/>\n\t<br \/>\u5c71\u7530 \u535a\u53f8\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09, \u4f4f\u7530 \u6f6e\uff08\u56fd\u969b\u5927\u5b66\uff0fUniv. of Rochester)\n\t<\/ul>\n<\/p>\n<ul>\n<li>Dynamic Analysis of MMPP\/G\/1  Queueing Systems\uff1aBusy Period, Idle Probability, and Number of Customers in System<br \/>\n\t<br \/>\u4f4f\u7530 \u6f6e\uff08\u56fd\u969b\u5927\u5b66\uff0fUniv. of Rochester\uff09\u4f4f\u7530 \u4fee\u4e00, \u9ad8\u6a4b \u656c\u9686, \u5c71\u7530 \u535a\u53f8\uff08NTT\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u691c\u67fb\u5de5\u7a0b\u3092\u542b\u3080\u751f\u7523\u30b7\u30b9\u30c6\u30e0\u306e\u5f85\u3061\u884c\u5217\u30e2\u30c7\u30eb<br \/>\n\t<br \/>\u5742\u672c \u82f1\u592b, \u68ee \u96c5\u592b\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Optimal Static Load Balancing in Star Network Configurations with Two-Way Traffic<br \/>\n\t<br \/>\u674e \u9821, \u4e80\u7530 \u58fd\u592b\uff08\u96fb\u6c17\u901a\u4fe1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30d0\u30fc\u30b9\u30c8\u6027\u591a\u5143\u30c8\u30e9\u30d2\u30c3\u30af\u306e\u6027\u80fd\u89e3\u6790\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u5965\u7530 \u9686\u53f2, \u79cb\u4e38 \u6625\u592b, \u9234\u6728 \u5be7\uff08\u8c4a\u6a4b\u6280\u8853\u79d1\u5b66\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Software Reliability Measurement and Estimation During Operation Phase and Application<br \/>\n\t<br \/>\u6728\u6751 \u5149\u5b8f, \u5c71\u7530 \u8302, \u5c3e\u5d0e \u4fca\u6cbb\uff08\u5e83\u5cf6\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u901a\u4fe1\u7db2\u306b\u304a\u3051\u308b\u30db\u30fc\u30c8\u30f3\u306e\u6cd5\u5247\u306e\u691c\u8a3c<br \/>\n\t<br \/>\u5c71\u7530 \u5b5d\u5b50\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09, \u80fd\u689d \u54f2\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09, \u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u901a\u4fe1\u7a7a\u8abf\u30b7\u30b9\u30c6\u30e0\u306e\u4fe1\u983c\u6027\u8a55\u4fa1\u6cd5\u306e\u691c\u8a0e<br \/>\n\t<br \/>\u56db\u5bae \u5149\u6587, \u6e21\u8fba \u5747, \u80fd\u689d \u54f2\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Modeling and Performance Analysis of Electronic Switching Systems&#8212;Past, Present, and Future<br \/>\n\t<br \/>\u4f4f\u7530 \u4fee\u4e00\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\n\t\u76f4\u5217\u578b\u5f85\u3061\u884c\u5217\u306e\u5b89\u5b9a\u6027\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u5ddd\u5cf6 \u6b66\uff08\u9632\u885b\u5927\u5b66\u6821\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A Review of Regenerative Processes<br \/>\n\t<br \/>Ronald W. Wolff\uff08University of California, Berkeley\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>On Discrete-Time Single-Server Queues with Markov Modulated Batch Bernoulli Input and Finite<br \/>\nCapacity<br \/>\n\t<br \/>\u571f\u5c4b \u5229\u660e\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09, \u9ad8\u6a4b \u656c\u9686\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u5171\u6709\u30d0\u30c3\u30d5\u30a1\u3092\u3082\u3064\u30bf\u30f3\u30c7\u30e0\u578b\u5f85\u3061\u884c\u5217\u306e\u53ef\u9006\u6027<br \/>\n\t<br \/>\u4f50\u6cbb \u771f\u54c9\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>0n Extremal Service Disciplines in Time Sharing Service Systems<br \/>\n\t<br \/>\u524d\u7530 \u6d0b, \u5927\u897f \u5321\u5149, \u8328\u6728 \u4fca\u79c0\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u5f85\u3061\u72b6\u614b\u306e\u3042\u308b\u30ed\u30c3\u30af\u5236\u5fa1\u3068\u305d\u306e\u8a55\u4fa1<br \/>\n\t<br \/>\u848b \u6e67, \u897f\u6751 \u5f70\u4e00\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Virtual Waiting Time of an MAP\/G\/1 Queue with Setup Time<br \/>\n\t<br \/>\u5c0f\u6ca2 \u5229\u4e45\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u5358\u4e00\u5236\u9650\u578b\u975e\u5272\u308a\u8fbc\u307f\u512a\u5148\u51e6\u7406\u5f0f\u5de1\u56de\u578b\u591a\u91cd\u5f85\u3061\u884c\u5217\u306e\u5e73\u5747\u5217\u5f85\u3061\u6642\u9593\u306e\u5c0e\u51fa<br \/>\n\t<br \/>\u6df1\u5ddd \u5e78\u7d00, \u5927\u6728 \u6b63\u5f66\uff08\u897f\u65e5\u672c\u5de5\u696d\u5927\u5b66\uff09, \u6751\u4e0a \u5468\u592a\uff08\u4e5d\u5dde\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>M\/G\/1\/K Queues with N-Policy and Setup Times<br \/>\n\t<br \/>\u9ad8\u6728 \u82f1\u660e\uff08\u65e5\u672cIBM\u6771\u4eac\u57fa\u790e\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>An Analogue of Little&#8217;s Formula for Heavy Traffic Limits in Queues<br \/>\n\t<br \/>\u5c71\u7530 \u656c\u543e\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>M\/G\/1\/N \u304b\u3089\u306e\u51fa\u529b\u5206\u5e03\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u77f3\u5ddd \u660e\u5f66\uff08\u5ca9\u624b\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30b7\u30e5\u30df\u30ec\u30fc\u30b7\u30e7\u30f3\u306b\u304a\u3051\u308b\u521d\u671f\u6761\u4ef6\u306e\u9664\u53bb\u554f\u984c<br \/>\n\t<br \/>\u4e2d\u585a \u5229\u76f4\uff08\u6771\u4eac\u90fd\u7acb\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Functional Properties of Time Dependent M\/G\/1 and the Ordering of the Doubly Stochastic Poisson Processes<br \/>\n\t<br \/>\u4e0b\u5ddd \u4fe1\u7950\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>On Ladder Height Distributions of General Risk Processes<br \/>\n\t<br \/>\u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09, Volker Schmidt\uff08Freiberg \u9271\u5c71\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Covariance Structure of Interrupted Markov Modulated Poisson Processes<br \/>\n\t<br \/>\u753a\u539f \u6587\u660e\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>On Fundamental Equations Arising in the Analysis of an Alternating Service Queue with Bernoulli Schedules<br \/>\n\t<br \/>\u7247\u5c71 \u52c1\uff08\u5bae\u5c71\u770c\u7acb\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A Bibliography of Research on Heavy Traffic Limit Theorems for Queues<br \/>\n\t<br \/>\u6728\u6751 \u4fca\u2212\uff08\u5317\u6d77\u9053\u5927\u5b66\uff09\n\t<\/ul><\/p>\n","protected":false},"excerpt":{"rendered":"<p>1991\u5e74\u5ea6\uff08\u7b2c10\u56de\uff09\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0 &#8220;\u60c5\u5831\u30fb\u901a\u4fe1\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306b\u95a2\u3059\u308b\u5f85\u3061\u884c\u5217\u30e2\u30c7\u30eb\u306e\u7dcf\u5408\u7684\u7814\u7a76&#8221; \u65e5\u6642: 1992\u5e741\u670823-25\u65e5 \u5834\u6240: \u6d5c\u677e\u30fb\u6d5c\u540d\u8358 \u79d1\u5b66\u7814\u7a76\u8cbb\u88dc\u52a9\u91d1 \u7dcf\u5408\u7814\u7a76 (A),  [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":24,"menu_order":47,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_mc_calendar":[]},"_links":{"self":[{"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/239"}],"collection":[{"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/comments?post=239"}],"version-history":[{"count":2,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/239\/revisions"}],"predecessor-version":[{"id":259,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/239\/revisions\/259"}],"up":[{"embeddable":true,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/24"}],"wp:attachment":[{"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/media?parent=239"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}