{"id":241,"date":"2021-03-19T14:39:01","date_gmt":"2021-03-19T05:39:01","guid":{"rendered":"https:\/\/orsj.org\/queue\/?page_id=241"},"modified":"2021-03-19T14:39:01","modified_gmt":"2021-03-19T05:39:01","slug":"quesym1990","status":"publish","type":"page","link":"https:\/\/orsj.org\/queue\/symposium\/quesym_history\/quesym1990\/","title":{"rendered":"1990\u5e74\u5ea6(\u7b2c9\u56de)\u5f85\u3061\u884c\u5217\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0"},"content":{"rendered":"<p>    <center><\/p>\n<h2>1990\u5e74\u5ea6\uff08\u7b2c9\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: 1991\u5e741\u670817-19\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>Mixed Delay and Nondelay Systems with Priorities<br \/>\n\t<br \/>\u725b \u5fd7\u5347, \u79cb\u4e38 \u6625\u592b\uff08\u8c4a\u6a4b\u6280\u8853\u79d1\u5b66\u5927\u5b66\u60c5\u5831\u5de5\u5b66\u7cfb\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u4f01\u696d\u5185\u901a\u4fe1\u7db2\u30c8\u30dd\u30ed\u30b8\u30fc\u306e\u5206\u5272\u6c7a\u5b9a\u6cd5<br \/>\n\t<br \/>\u5927\u524d \u7fa9\u6b21, \u6e21\u8fba \u7be4, \u7af9\u4e0b \u5e78\uff08\u8328\u57ce\u5927\u5b66\u5de5\u5b66\u90e8\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u5236\u5fa1\u9045\u5ef6\u30fb\u30c7\u30fc\u30bf\u4f1d\u9001\u9045\u5ef6\u3092\u8003\u616e\u3057\u305f\u8f3b\u8f33\u5236\u5fa1\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>\u30de\u30eb\u30c1\u30c1\u30e4\u30cd\u30ebATM\u4ea4\u63db\u6a5f\u306e\u6027\u80fd\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u9418 \u6587\u5fb3, \u5c0f\u91ce\u91cc \u597d\u90a6\uff08\u96fb\u6c17\u901a\u4fe1\u5927\u5b66\u96fb\u5b50\u60c5\u5831\u5b66\u79d1\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A Decomposition Algorithm for Optimal Static Load Balancing in Tree Hierarchy Nelwork Configurations<br \/>\n\t<br \/>\u674e \u9821, \u4e80\u7530 \u58fd\u592b\uff08\u96fb\u6c17\u901a\u4fe1\u5927\u5b66\u60c5\u5831\u5de5\u5b66\u79d1\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Switched Batch Bernoulli Process (SBBP) and the Discrete-Time SBBP\/G\/1 Queue with Application to Statistical Multiplexer Performance<br \/>\n\t<br \/>\u6a4b\u7530 \u6e29\uff08\u7b51\u6ce2\u5927\u5b66\u7d4c\u55b6\u30b7\u30b9\u30c6\u30e0\u79d1\u5b66\uff09, \u9ad8\u6a4b \u656c\u9686, \u4e0b\u5ddd \u4fe1\u7950\uff08NTT\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30ea\u30bd\u30fc\u30b9\u7af6\u5408\u306e\u3042\u308b\u52d5\u7684\u30b5\u30fc\u30d0\u7fa4\u30e2\u30c7\u30eb\u306e\u8fd1\u4f3c\u89e3\u6790<br \/>\n\t<br \/>\u80fd\u4e0a \u614e\u4e5f\uff08NTT\u4ea4\u63db\u30b7\u30b9\u30c6\u30e0\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30b5\u30fc\u30d3\u30b9\u901f\u5ea6\u306e\u5207\u308a\u66ff\u3048\u306b\u4f34\u3046\u30bb\u30c3\u30c8\u30a2\u30c3\u30d7\u306e\u3042\u308bM\/G\/1\u30b7\u30b9\u30c6\u30e0<br \/>\n\t<br \/>\u897f\u30f6\u8c37 \u5cb3, \u690b\u672c \u4ecb\u58eb, \u798f\u7530 \u660e\uff08\u9759\u5ca1\u5927\u5b66\u5de5\u5b66\u90e8\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u6271\u3044\u8005\u6b69\u884c\u904e\u7a0b\u4ed8\u304d\u9ad8\u512a\u5148\u30ec\u30d9\u30eb\u518d\u691c\u67fb\u65b9\u5f0f\u512a\u5148\u6a29\u5f85\u3061\u884c\u5217<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>\u30d7\u30ed\u30bb\u30c3\u30b5\u80fd\u7387\u6e2c\u5b9a\u5024\u306e\u5206\u5e03\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u5c0f\u6ca2 \u5229\u4e45\uff08NTT\u4ea4\u63db\u30b7\u30b9\u30c6\u30e0\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Distribution of the Workload in Multiclass Queueing Systems with Server Vacations<br \/>\n\t<br \/>\u9ad8\u6728\u82f1\u660e\uff08\u65e5\u672cIBM\u6771\u4eac\u57fa\u790e\u7814\u7a76\u6240\uff09, \u6edd\u6839 \u54f2\u54c9\uff08\u4eac\u90fd\u5927\u5b66\u5de5\u5b66\u90e8\uff09, Onno J\uff0eBoxma\uff08Center for Mathematics &#038; Computer Science\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>SPP\/G\/1 Queue with Multiple Vacations and Exhaustive Service Discipline<br \/>\n\t<br \/>\u6edd\u6839 \u54f2\u54c9, \u9577\u8c37\u5ddd \u5229\u6cbb\uff08\u4eac\u90fd\u5927\u5b66\u5de5\u5b66\u90e8\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Geometric Methods on Markov Chains and Their Applications to Spectral Analysis of Queues<br \/>\n\t<br \/>\u4e0b\u5ddd \u4fe1\u7950\uff08NTT\u4ea4\u63db\u30b7\u30b9\u30c6\u30e0\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A Batch-Arrival Batch-Service Queueing System<br \/>\n\t<br \/>\u7d00 \u4e00\u8aa0\uff08\u65e5\u672c\u96fb\u6c17C\uff06C\u60c5\u5831\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u904e\u6e21\u89e3\u306e Matrix-geometric \u5f62\u5f0f\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u7267\u672c \u76f4\u6a39\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\u7406\u5b66\u90e8\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u547c\u6e90\u6577\u304c\u78ba\u7387\u7684\u306b\u5909\u52d5\u3059\u308b\u7cfb\u306b\u3064\u3044\u3066<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>\u30c7\u30fc\u30bf\u30d9\u30fc\u30b9\u306b\u304a\u3051\u308b\u540c\u6642\u5236\u5fa1\u3068\u6027\u80fd\u8a55\u4fa1 (No Waiting Case)<br \/>\n\t<br \/>\u897f\u6751 \u5f70\u4e00, \u848b \u6e67\uff08\u7b51\u6ce2\u5927\u5b66\u793e\u4f1a\u5de5\u5b66\u7cfb\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u4e26\u5217\u5f85\u3061\u884c\u5217\u30e2\u30c7\u30eb\u306b\u304a\u3051\u308b\u5747\u8861\u904e\u7a0b<br \/>\n\t<br \/>\u4e2d\u585a \u5229\u76f4\uff08\u6771\u4eac\u90fd\u7acb\u5927\u5b66\u7d4c\u6e08\u5b66\u90e8\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Rate Conservation Principle for Discrete\u2212Time Queues<br \/>\n\t<br \/>\u9ad8\u6a4b \u656c\u9686\uff08NTT\u4ea4\u63db\u30b7\u30b9\u30c6\u30e0\u7814\u7a76\u6240\uff09, \u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\u7406\u5de5\u5b66\u90e8\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>0n Active Bursts in a Queue with Continuous Burst Arrivals<br \/>\n\t<br \/>\u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\u7406\u5de5\u5b66\u90e8\uff09, \u5c71\u5d0e \u6e90\u6cbb\uff08\u6771\u4eac\u90fd\u7acb\u79d1\u5b66\u6280\u8853\u5927\u5b66\uff09,<br \/>\n\t<br \/>Karl Sigman\uff08Columbia University\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A Note on Conservation Laws for a Multi-Class Service Queueing System with Setup Times<br \/>\n\t<br \/>\u7247\u5c71 \u52c1\uff08\u5bcc\u5c71\u770c\u7acb\u5927\u5b66\u5de5\u5b66\u90e8\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>lnterpolation Approximations for the Mean Delay in a Multi-Server Queue<br \/>\n\t<br \/>\u6728\u6751 \u4fca\u2212\uff08\u5317\u6d77\u9053\u5927\u5b66\u7d4c\u6e08\u5b66\u90e8\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>On the Equivalent of Two Types of Blocking in Non-Markovian Tandem Queues<br \/>\n\t<br \/>\u9006\u702c\u5ddd \u6d69\u5b5d\uff08\u7b51\u6ce2\u5927\u5b66\u793e\u4f1a\u5de5\u5b66\u7cfb\uff09, \u5ddd\u5cf6 \u6b66\uff08\u9632\u8861\u5927\u5b66\u679a\u6570\u5b66\u6559\u5ba4\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Optimal Scheduling for Queueing System with Customer Deadlines<br \/>\n\t<br \/>\u91d1\u5c71 \u9054\u592b, \u5927\u897f \u5321\u5149, \u8328\u6728 \u4fca\u79c0\uff08\u4eac\u90fd\u5927\u5b66\u5de5\u5b66\u90e8\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>An Efficient Aggregation Method for Large Markov Chains<br \/>\n\t<br \/>\u5869\u5c71 \u5fe0\u7fa9, \u7530\u4e2d \u516c\u5e78\uff08\u4eac\u90fd\u5de5\u82b8\u7e4a\u7dad\u5927\u5b66\u6a5f\u68b0\u30b7\u30b9\u30c6\u30e0\u5de5\u5b66\u79d1\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u56de\u7dda\u4ea4\u63db\u7db2\u306b\u304a\u3051\u308b\u30eb\u30fc\u30c1\u30f3\u30b0\u306e\u52b9\u679c\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u77e2\u7530 \u5065, \u68ee \u96c5\u592b\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\u5de5\u5b66\u90e8\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Cross Aggregation Method for Kanban Systems<br \/>\n\t<br \/>\u5b8b \u5b87\uff08\u6771\u5317\u5927\u5b66\u7d4c\u6e08\u5b66\u90e8\uff09, \u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\u7406\u5b66\u90e8\uff09\n\t<\/ul><\/p>\n","protected":false},"excerpt":{"rendered":"<p>1990\u5e74\u5ea6\uff08\u7b2c9\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: 1991\u5e741\u670817-19\u65e5 \u5834\u6240: \u6d5c\u677e\u30fb\u6d5c\u540d\u8358 \u79d1\u5b66\u7814\u7a76\u8cbb\u88dc\u52a9\u91d1 \u7dcf\u5408\u7814\u7a76 (A), \u8ab2 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":24,"menu_order":48,"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\/241"}],"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=241"}],"version-history":[{"count":2,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/241\/revisions"}],"predecessor-version":[{"id":260,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/241\/revisions\/260"}],"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=241"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}