{"id":201,"date":"2021-03-19T14:24:10","date_gmt":"2021-03-19T05:24:10","guid":{"rendered":"https:\/\/orsj.org\/queue\/?page_id=201"},"modified":"2021-03-19T14:24:10","modified_gmt":"2021-03-19T05:24:10","slug":"quesym1993","status":"publish","type":"page","link":"https:\/\/orsj.org\/queue\/symposium\/quesym_history\/quesym1993\/","title":{"rendered":"1993\u5e74\u5ea6(\u7b2c12\u56de)\u5f85\u3061\u884c\u5217\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0"},"content":{"rendered":"<p>    <center><\/p>\n<h2>1993\u5e74\u5ea6\uff08\u7b2c12\u56de\uff09\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0<br \/>\n      &#8220;\u60c5\u5831\u901a\u4fe1\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306b\u95a2\u3059\u308b\u6027\u80fd\u8a55\u4fa1\u30e2\u30c7\u30eb\u306e\u7dcf\u5408\u7684\u7814\u7a76&#8221;<\/h2>\n<p>      \u65e5\u6642: 1994\u5e741\u670819-21\u65e5<br \/>\n      \u5834\u6240: \u7bb1\u6839\u30fb\u9759\u96f2\u8358<br \/>\n      \u79d1\u5b66\u7814\u7a76\u8cbb\u88dc\u52a9\u91d1 \u7dcf\u5408\u7814\u7a76 (A), \u8ab2\u984c\u756a\u53f7 05302066<br \/>\n      \u7814\u7a76\u4ee3\u8868\u8005: \u6a4b\u7530 \u6e29\uff08\u7b51\u6ce2\u5927\u5b66\uff09<br \/>\n    <\/center><\/p>\n<hr>\n<ul>\n<li>Analysis of M(n)\/G\/1\/K Queues with Multiple Server Vacations<br \/>\n\t<br \/>\u99ac\u5834 \u88d5\uff08\u6a2a\u6d5c\u56fd\u7acb\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30b5\u30fc\u30d3\u30b9\u6642\u9593\u306e\u5909\u66f4\u306b\u4f34\u30462\u65b9\u5411\u6e96\u5099\u6642\u9593\u30e2\u30c7\u30eb<br \/>\n\t<br \/>\u897f\u6751 \u5f70\u4e00\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\uff0c\u848b \u6e67\uff08\u6771\u4eac\u90fd\u7acb\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Mean Sojourn Times of Multiclass M\/G\/1 Queues with Feedback: Nonpreemptive Disciplines<br \/>\n\t<br \/>\u5927\u8cc0 \u7965\u4e45\uff0c\u6d2a \u8aa0\u689d\uff0c\u5e73\u5c71 \u54f2\u6cbb\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Queueing Networks with Nested Routing Chains and Outstanding Queues<br \/>\n\t<br \/>\u7d00 \u4e00\u8aa0\uff08NEC C\uff06C \u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Symmetric Queues with Batch Departures and their Networks<br \/>\n\t<br \/>\u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\uff0cRonald W. Wolff\uff08U.C.\uff0cBerkeley\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u78ba\u7387\u7684\u9806\u5e8f\u306b\u5f93\u30461\u4e00\u5236\u9650\u5f0f\u30dc\u30fc\u30ea\u30f3\u30b0\u30b7\u30b9\u30c6\u30e0\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u6d25\u91d1 \u82f1\u884c\uff0c\u5c71\u4e0b \u82f1\u660e\uff0c\u9234\u6728 \u8aa0\u9053\uff08\u4e0a\u667a\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Optimal Scheduling Policies for Queueing Systems with Customer Deadlines and Costs<br \/>\n\t<br \/>\u5927\u897f \u5321\u5149\uff08\u6771\u5317\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u751f\u7523\u5f85\u3061\u884c\u5217\u30b7\u30b9\u30c6\u30e0\u306e\u6700\u9069\u8a2d\u8a08\u554f\u984c<br \/>\n\t<br \/>\u677e\u4e95 \u6b63\u4e4b\uff08\u96fb\u6c17\u901a\u4fe1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u591a\u884c\u7a0b\u6301\u3061\u751f\u7523\u30e9\u30a4\u30f3\u306b\u95a2\u3059\u308b\u7814\u7a76<br \/>\n\t<br \/>\u4e2d\u51fa \u5eb7\u4e00\uff0c\u5927\u91ce \u52dd\u4e45\uff08\u540d\u53e4\u5c4b\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>On a Rule &#8216;More Irregular Server should be Faster&#8217; for Two-Server Tandem Queues<br \/>\n\t<br \/>\u5c71\u5d0e \u6e90\u6cbb\uff0c\u4f0a\u85e4 \u535a\u53f8\uff08\u6771\u4eac\u90fd\u7acb\u79d1\u5b66\u6280\u8853\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Design of Growing Subscriber Networks with High Reliability and Low Cost I; Simulation Study of Tree Structured Case<br \/>\n\t<br \/>\u5c71\u7530 \u5b5d\u5b50\uff0c\u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Approximating the Steady-State Probabilities in the M\/G\/s Queue with Finite Waiting Spaces<br \/>\n\t<br \/>\u6728\u6751 \u4fca\u4e00\uff08\u5317\u6d77\u9053\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>A Bridge between Preemptive and Non-Preemptive Queueing Models<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>Perturbation Analysis for the GI\/G\/1 Priority Queue<br \/>\n\t<br \/>\u4e09\u597d \u76f4\u4eba\uff0c\u9577\u8c37\u5ddd \u5229\u6cbb\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>MAP\/G\/1 Queues under N-Policy with and without Vacations<br \/>\n  \t<br \/>\u7b20\u539f \u6b63\u6cbb\uff0c\u6edd\u6839 \u54f2\u54c9\uff0c\u9ad8\u6a4b \u8c4a\uff0c\u9577\u8c37\u5ddd \u5229\u6cbb\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Analysis of a Discrete-Time Queueing System with Time-Limited Service<br \/>\n\t<br \/>\u9ad8\u6728 \u82f1\u660e\uff08\u7b51\u6ce2\u5927\u5b66\uff09\uff0cKin K. Leung\uff08AT&#038;T, Bell Laboratories\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>On the Pseudo-Conservation Law for Discrete-Time Multi-Queue Systems with Priority Disciplines<br \/>\n\t<br \/>\u9ad8\u6a4b \u656c\u9686\uff0cKrishna Kumar\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Analysis of a Discrete-Time Queue with a Gate<br \/>\n\t<br \/>\u77f3\u5d0e \u6587\u96c4\uff08\u8fd1\u757f\u5927\u5b66\uff09\uff0c\u6edd\u6839 \u54f2\u54c9\uff0c\u9577\u8c37\u5ddd \u5229\u6cbb\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u60c5\u5831\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u30b7\u30b9\u30c6\u30e0\u3068\u30ea\u30b9\u30af\u30de\u30cd\u30fc\u30b8\u30e1\u30f3\u30c8<br \/>\n\t<br \/>\u5927\u524d \u7fa9\u6b21\uff08\u795e\u5948\u5ddd\u5de5\u79d1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u60c5\u5831\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306b\u304a\u3051\u308b\u62e1\u6563\u904e\u7a0b\u3068\u793e\u4f1a\u73fe\u8c61<br \/>\n\t<br \/>\u6a4b\u7530 \u6e29\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>ATM\u7db2\u306b\u304a\u3051\u308b\u547c\u53d7\u4ed8\u5236\u5fa1\u306e\u30d1\u30e9\u30e1\u30fc\u30bf\u8a2d\u8a08\u6cd5<br \/>\n\t<br \/>\u5ddd\u6751 \u5b9c\u4f2f\uff0c\u6589\u85e4 \u6d0b\uff08NTT\u901a\u4fe1\u7db2\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>ATM\u7db2\u30ea\u30f3\u30af\u3075\u304f\u305d\u3046\u5236\u5fa1\u306e\u89e3\u6790<br \/>\n\t<br \/>\u592a\u7530 \u6b63\u5b5d\uff08\u65e5\u7acb\u88fd\u4f5c\u6240\u30b7\u30b9\u30c6\u30e0\u958b\u767a\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30c8\u30e9\u30d2\u30c3\u30af\u96c6\u4e2d\u3092\u8003\u616e\u3057\u305f\u56de\u8def\u4ea4\u63db\u7db2\u306b\u304a\u3051\u308b\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306e\u5b89\u5b9a\u6027<br \/>\n\t<br \/>\u91d1\u6ca2 \u4e9c\u7f8e\uff0c\u5d8b\u672c \u85ab\uff0c\u5c0f\u91ce\u91cc \u597d\u90a6\uff08\u7fa4\u99ac\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u4e0d\u5747\u4e00\u306a\u30c8\u30e9\u30d5\u30a3\u30c3\u30af\u7279\u6027\u3092\u8003\u616e\u3057\u305f\u6355\u6349\u52b9\u679c\u3092\u7528\u3044\u305f\u5272\u308a\u5f53\u3066\u30a6\u30a3\u30f3\u30c9\u30a6\u30a2\u30af\u30bb\u30b9\u65b9\u5f0f\u306b\u95a2\u3059\u308b\u8003\u5bdf<br \/>\n\t<br \/>\u5de5\u85e4 \u5149\uff0c\u5d8b\u672c \u85ab\uff0c\u5c0f\u91ce\u91cc \u597d\u90a6\uff08\u7fa4\u99ac\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30eb\u30fc\u30d7\u30d0\u30b9\u5f62\u5f85\u3061\u884c\u5217\u30b7\u30b9\u30c6\u30e0\u306e\u7279\u6027\u89e3\u6790<br \/>\n \t<br \/>\u77f3 \u8cb4\u5897\uff0c\u798f\u7530 \u660e\uff08\u9759\u5ca1\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u901a\u4fe1\u30b7\u30b9\u30c6\u30e0\u306b\u304a\u3051\u308b Large Deviation \u7406\u8ad6\u306e\u5229\u7528\u3068ATM\u30bb\u30eb\u5ec3\u68c4\u7387\u306e\u63a8\u5b9a\t<br \/>\u6cb3\u6771 \u6674\u5b50\uff08\u4e09\u83f1\u96fb\u6a5f\u901a\u4fe1\u30b7\u30b9\u30c6\u30e0\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>\u30d5\u30e9\u30af\u30bf\u30eb\u7684\u5358\u4e00\u30b5\u30fc\u30d0\u5f85\u3061\u884c\u5217\u306e\u30b9\u30b1\u30fc\u30eb\u30a2\u30c3\u30d7\u5247<br \/>\n\t<br \/>\u4e0b\u5ddd \u4fe1\u7950\uff08ATR\u5149\u96fb\u6ce2\u901a\u4fe1\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Transient Analysis of Fluid Approximation Model for Multi-Entry Queueing System in ATM Statistical Multiplexing<br \/>\n\t<br \/>\u7530\u4e2d \u6b66\u5fd7\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\uff0c\u6a4b\u7530 \u6e29\uff08\u7b51\u6ce2\u5927\u5b66\uff09\uff0c\u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Steady State Approximation Analysis for ATM Multiplexer by Diffusion Process without Reflection Barriers<br \/>\n\t<br \/>\u5c0f\u6797 \u548c\u671d\uff08NEC C&#038;C\u7814\u7a76\u6240\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Analysis of a Cyclic-Service Tandem Queue with a Gate and Vacations<br \/>\n \t<br \/>\u7247\u5c71 \u52c1\uff08\u5bcc\u5c71\u770c\u7acb\u5927\u5b66\uff09\n\t<\/ul>\n<\/p>\n<ul>\n<li>Mean Delay Analysis for Finite-Capacity M\/G\/1 Head-of-Line Priority Queues with Push-Out Scheme<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>\u5438\u53ce\u904e\u7a0b<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>The Effect of Parallel Processing and Hill-Climbing Methods on Genetic Algorithms<br \/>\n\t<br \/>\u5927\u4e95 \u8087\uff0c\u54c1\u5ddd \u660e\u96c4\uff0c\u5ca1\u7530 \u6d69\u4e4b\uff0c\u897f\u6751 \u5229\u6d69\uff0c\u4f0a\u85e4 \u88d5\u5eb7\uff08\u5bcc\u58eb\u901a\u30b7\u30b9\u30c6\u30e0\u7dcf\u7814\uff09\n\t<\/ul><\/p>\n","protected":false},"excerpt":{"rendered":"<p>1993\u5e74\u5ea6\uff08\u7b2c12\u56de\uff09\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0 &#8220;\u60c5\u5831\u901a\u4fe1\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306b\u95a2\u3059\u308b\u6027\u80fd\u8a55\u4fa1\u30e2\u30c7\u30eb\u306e\u7dcf\u5408\u7684\u7814\u7a76&#8221; \u65e5\u6642: 1994\u5e741\u670819-21\u65e5 \u5834\u6240: \u7bb1\u6839\u30fb\u9759\u96f2\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":45,"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\/201"}],"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=201"}],"version-history":[{"count":2,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/201\/revisions"}],"predecessor-version":[{"id":237,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/201\/revisions\/237"}],"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=201"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}