{"id":192,"date":"2021-03-19T14:08:34","date_gmt":"2021-03-19T05:08:34","guid":{"rendered":"https:\/\/orsj.org\/queue\/?page_id=192"},"modified":"2021-03-19T14:08:34","modified_gmt":"2021-03-19T05:08:34","slug":"quesym1997","status":"publish","type":"page","link":"https:\/\/orsj.org\/queue\/symposium\/quesym_history\/quesym1997\/","title":{"rendered":"1997\u5e74\u5ea6(\u7b2c16\u56de)\u5f85\u3061\u884c\u5217\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0"},"content":{"rendered":"<p>    <center><\/p>\n<h2>1997\u5e74\u5ea6\uff08\u7b2c16\u56de\uff09\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0<br \/>\n      &#8220;\u60c5\u5831\u901a\u4fe1\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306e\u65b0\u3057\u3044\u6027\u80fd\u8a55\u4fa1\u6cd5\u306b\u95a2\u3059\u308b\u7dcf\u5408\u7684\u7814\u7a76&#8221;<\/h2>\n<p>      \u65e5\u6642: 1998\u5e741\u670819-21\u65e5<br \/>\n      \u5834\u6240: \u4eac\u90fd\u30fb\u30b3\u30df\u30e5\u30cb\u30c6\u30a3\u5d6f\u5ce8\u91ce\uff08\u4eac\u90fd\u5e9c\u52e4\u52b4\u8005\u7814\u4fee\u30bb\u30f3\u30bf\u30fc\uff09<br \/>\n      \u79d1\u5b66\u7814\u7a76\u8cbb\u88dc\u52a9\u91d1 \u57fa\u76e4\u7814\u7a76 (A)(1), \u8ab2\u984c\u756a\u53f7 08308025<br \/>\n      \u7814\u7a76\u4ee3\u8868\u8005: \u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09<br \/>\n    <\/center><\/p>\n<hr>\n<ul>\n<li>Numerical analysis of cyclic AGV systems with multiple vehicles<br \/>\n\t<br \/>\u5c71\u4e0b \u82f1\u660e\uff08\u99d2\u6fa4\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Decomposition algorithm for performance evaluation of AGV systems<br \/>\n\t<br \/>\u4e2d\u91ce \u51a0\uff08\u8c4a\u7530\u4e2d\u592e\u7814\u7a76\u6240\uff09\uff0c\u5927\u91ce \u52dd\u4e45\uff08\u540d\u53e4\u5c4b\u5de5\u696d\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>M\/G\/S queueing facility location on a network via evolutionary computation<br \/>\n\t<br \/>Dijin Gong\uff0c\u5c71\u5d0e \u6e90\u6cbb\uff08\u6771\u4eac\u90fd\u7acb\u79d1\u5b66\u6280\u8853\u5927\u5b66\uff09\uff0c\u7384 \u5149\u7537\uff08\u8db3\u5229\u5de5\u696d\u5927\u5b66\uff09\uff0cWeixuan Xu\uff08Chinese Academy of Sciences\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u5f85\u3061\u3092\u4f34\u3046\u30b8\u30e7\u30d6\u306e\u6700\u77ed\u51e6\u7406\u6642\u9593\u554f\u984c<br \/>\n\t<br \/>\u5c0f\u67f3 \u6df3\u4e8c\uff0c\u6cb3\u5408 \u4e00\uff08\u9ce5\u53d6\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u30c8\u30e9\u30d2\u30c3\u30af\u30b7\u30b9\u30c6\u30e0\u306f\u3069\u306e\u3088\u3046\u306b\u6210\u308a\u7acb\u3063\u3066\u3044\u308b\u304b\uff1f<br \/>\n\t<br \/>\u4e0b\u5ddd \u4fe1\u7950\uff08ATR\u74b0\u5883\u9069\u5fdc\u901a\u4fe1\u7814\u7a76\u6240\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u901a\u4fe1\u30c8\u30e9\u30d2\u30c3\u30af\u306e\u30d5\u30e9\u30af\u30bf\u30eb\u6027\u306e\u691c\u8a3c\u65b9\u6cd5\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u6642\u6c38 \u7965\u4e09\uff0c\u7af9\u6797 \u6e09\uff08\u4e5d\u5dde\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Demand\/routing control and capacity expansion of network systems<br \/>\n\t<br \/>\u5897\u7530 \u9756\uff08\u6176\u61c9\u7fa9\u587e\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Exact loss probability calculation with queue length in the corresponding infinite-buffer queue<br \/>\n\t<br \/>\u77f3\u5d0e \u6587\u96c4\uff08\u5fb3\u5cf6\u5927\u5b66\uff09\uff0c\u6edd\u6839 \u54f2\u54c9\uff08\u5927\u962a\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Diffusion models for queues in computer\/communication systems<br \/>\n\t<br \/>\u6728\u6751 \u4fca\u4e00\uff08\u5317\u6d77\u9053\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Importance sampling simulation \u306b\u304a\u3051\u308b\u6700\u9069\u6e2c\u5ea6\u5909\u63db<br \/>\n\t<br \/>\u9006\u702c\u5ddd \u6d69\u5b5d\uff08\u65e9\u7a32\u7530\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u4e26\u5217\u5f85\u3061\u884c\u5217 PH\/PH\uff0cPH\/2 \u306e\u5b9a\u5e38\u5206\u5e03\u306e\u6f38\u8fd1\u6027\u3068\u6570\u5024\u8a08\u7b97<br \/>\n\t<br \/>\u4ee3\u7530 \u5c06\u4e5f\uff0c\u85e4\u672c \u8861\uff0c\u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Buffer management and queueing disciplines for ATM systems<br \/>\n\t<br \/>\u4f4f\u7530 \u4fee\u4e00\uff08NTT\u30de\u30eb\u30c1\u30e1\u30c7\u30a3\u30a2\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u7814\u7a76\u6240\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u5e74\u9f62\u3092\u8003\u616e\u306b\u3044\u308c\u305f\u4fee\u7406\u30fb\u53d6\u66ff\u3048\u554f\u984c\u306b\u5bfe\u3059\u308b\u5358\u8abf\u306a\u4fee\u7406\u9650\u754c\u53d6\u66ff\u3048\u653f\u7b56\u306e\u6700\u9069\u6027<br \/>\n\t<br \/>\u702c\u5ddd \u826f\u4e4b\uff08\u4eac\u90fd\u5b66\u5712\u5927\u5b66\uff09\uff0c\u5927\u897f \u5321\u5149\uff08\u5927\u962a\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>A note on the stability of the Geo<sup>[X]<\/sup>\/D\/1 retrial queue with collision and geometric loss<br \/>\n\t<br \/>\u9ad8\u6a4b \u7f8e\u4f50\uff08\u96fb\u6c17\u901a\u4fe1\u5927\u5b66\uff09\uff0c\u5927\u6fa4 \u79c0\u96c4\uff08\u611b\u77e5\u5b66\u6cc9\u5927\u5b66\uff09\uff0c\u85e4\u6fa4 \u6b66\u4e45\uff08\u96fb\u6c17\u901a\u4fe1\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>On the queue with scheduled arrivals<br \/>\n\t<br \/>\u571f\u4e95 \u8aa0\uff08\u6771\u6d77\u5927\u5b66\uff09\uff0c\u5927\u6fa4 \u79c0\u96c4\uff08\u611b\u77e5\u5b66\u6cc9\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u30d6\u30ed\u30c3\u30ad\u30f3\u30b0\u3092\u6301\u3064\u751f\u7523\u30e9\u30a4\u30f3\u306b\u304a\u3051\u308b\u5e73\u5747\u30b5\u30a4\u30af\u30eb\u6642\u9593\u306e\u4e0a\u4e0b\u9650\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u4e2d\u51fa \u5eb7\u4e00\uff0c\u5927\u91ce \u52dd\u4e45\uff08\u540d\u53e4\u5c4b\u5de5\u696d\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Spectra matrix generating function for a MAP\/SM\/1 queue<br \/>\n\t<br \/>\u897f\u6751 \u5f70\u4e00\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\uff0c\u848b \u6e67\uff08\u611b\u77e5\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Transform free approximations for the moments of waiting time in GI\/G\/1 Queues<br \/>\n\t<br \/>\u99ac\u5834 \u88d5\uff08\u6a2a\u6d5c\u56fd\u7acb\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>The location of base stations in the personal handy phone systems<br \/>\n\t<br \/>\u5c71\u7530 \u5b5d\u5b50\uff08\u5c71\u5f62\u5927\u5b66\uff09\uff0c\u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Performance analysis of a preemptive priority handoff scheme in integrated voice and data cellular mobile systems<br \/>\n\t<br \/>\u674e \u6ce2\uff0c\u66fd \u6176\u5b89\uff0c\u690b\u672c \u4ecb\u58eb\uff0c\u798f\u7530 \u660e\uff08\u9759\u5ca1\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>TCP \u30d5\u30ed\u30fc\u5236\u5fa1\u306e\u904e\u6e21\u7684\u6027\u80fd\u306e\u8a55\u4fa1<br \/>\n\t<br \/>\u5c0f\u6ca2 \u5229\u4e45\uff0c\u671d\u9999 \u5353\u4e5f\uff08NTT\u30de\u30eb\u30c1\u30e1\u30c7\u30a3\u30a2\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u7814\u7a76\u6240\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u30a4\u30f3\u30bf\u30cd\u30c3\u30c8\u30a2\u30af\u30bb\u30b9\u306e\u5b9b\u5148\u30a2\u30c9\u30ec\u30b9\u751f\u8d77\u50be\u5411\u3092\u8a18\u8ff0\u3059\u308b\u53cc\u6751 Zipf \u6a21\u578b\u3068\u30ad\u30e3\u30c3\u30b7\u30e5\u30d2\u30c3\u30c8\u7387\u8a55\u4fa1\u6cd5\u3078\u306e\u5fdc\u7528<br \/>\n\t<br \/>\u4f1a\u7530 \u96c5\u6a39\uff0c\u9ad8\u6a4b \u7d00\u4e4b\uff0c\u5b89\u90e8 \u54f2\u54c9\uff08NTT\u30de\u30eb\u30c1\u30e1\u30c7\u30a3\u30a2\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u7814\u7a76\u6240\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u78ba\u7387\u904e\u7a0b\u306e\u30ef\u30fc\u30ad\u30f3\u30b0\u30bb\u30c3\u30c8\u7279\u6027<br \/>\n\t<br \/>\u7530\u4e2d \u6df3\u88d5\uff08NEC C&#038;C \u30e1\u30c7\u30a3\u30a2\u7814\u7a76\u6240\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Optimal checkpointing and rollback strategies with media failures: graphical solution approach<br \/>\n\t<br \/>\u571f\u80a5 \u6b63\uff0c\u5c0f\u6749 \u5c1a\u5b5d\uff08\u5e83\u5cf6\u5927\u5b66\uff09\uff0c\u6d77\u751f \u76f4\u4eba\uff08\u5e83\u5cf6\u4fee\u9053\u5927\u5b66\uff09\uff0c\u5c3e\u5d0e \u4fca\u6cbb\uff08\u5e83\u5cf6\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u30b9\u30da\u30af\u30c8\u30eb\u89e3\u6790\u306b\u3088\u308b MPEG2 \u30d3\u30c7\u30aa\u30c8\u30e9\u30d2\u30c3\u30af\u306e\u81ea\u5df1\u76f8\u4f3c\u6027<br \/>\n\t<br \/>\u5c0f\u6797 \u548c\u671d\uff08NEC C&#038;C \u30e1\u30c7\u30a3\u30a2\u7814\u7a76\u6240\uff09\uff0c\u5de5\u85e4 \u8aa0\u4e5f\uff0c\u9ad8\u6728 \u82f1\u660e\uff08\u7b51\u6ce2\u5927\u5b66\uff09\uff0c\u6ff1\u7530 \u5143\uff08CSK\uff09\uff0c\u4e45\u4fdd\u7530 \u6587\u4eba\uff08\u90f5\u653f\u7701\u901a\u4fe1\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u5e72\u6e09\u30c8\u30e9\u30d2\u30c3\u30af\u306e\u3042\u308b MPEG \u30d5\u30ec\u30fc\u30e0\u5217\u3092\u5165\u529b\u3068\u3059\u308b\u5f85\u3061\u884c\u5217\u30e2\u30c7\u30eb<br \/>\n\t<br \/>\u67f3\u751f \u5fc3\u5e73\uff0c\u9ad8\u6728 \u82f1\u660e\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>ATM \u30e1\u30ac\u30ea\u30f3\u30af\u30b5\u30fc\u30d3\u30b9\u3092\u5bfe\u8c61\u3068\u3057\u305f\u4f01\u696d\u901a\u4fe1\u7db2\u306e\u69cb\u7bc9\u6cd5<br \/>\n\t<br \/>\u4e8c\u968e\u5802 \u5149\u6d0b\uff0c\u68ee \u96c5\u592b\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Open BCMP queueing network \u306b\u304a\u3051\u308b\u76ee\u6a19\u306e\u7570\u306a\u308b\u6700\u9069\u5316\u306b\u5bfe\u3059\u308b\u6700\u9069\u5316\u9054\u6210\u5ea6<br \/>\n\t<br \/>\u5c0f\u6fa4 \u5b5d\u4e4b\uff0c\u4e80\u7530 \u58fd\u592b\uff0c\u674e \u9821\uff08\u7b51\u6ce2\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u5358\u7d14\u30d5\u30ec\u30ad\u30b7\u30d6\u30eb\u7d44\u7acb\u30b7\u30b9\u30c6\u30e0\u306e\u6027\u80fd\u8a55\u4fa1\u3068\u305d\u306e2\u6bb5\u968e\u8a2d\u8a08<br \/>\n\t<br \/>S. A. Feyzbakhsh\uff0c\u6728\u6751 \u662d\u4ec1\uff0c\u677e\u4e95 \u6b63\u4e4b\uff08\u96fb\u6c17\u901a\u4fe1\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u60c5\u5831\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306e\u30bb\u30eb\u30d5\u30d2\u30fc\u30ea\u30f3\u30b0\u30b7\u30df\u30e5\u30ec\u30fc\u30b7\u30e7\u30f3<br \/>\n\t<br \/>\u6797 \u5927\u8f14\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\uff0c\u5c0f\u5cf0 \u9686\u5b8f\uff08\u90f5\u653f\u7701\u901a\u4fe1\u7dcf\u5408\u7814\u7a76\u6240\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Cross aggregation method for large scale queueing networks<br \/>\n\t<br \/>\u6885\u539f \u5143\uff0c\u9ad8\u6a4b \u5e78\u96c4\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>A composite discrete-time queueing system with vacation \/ set-up \/ close-down times<br \/>\n\t<br \/>\u9152\u4e95 \u88d5\uff08\u4eac\u90fd\u5927\u5b66\uff09\uff0c\u9ad8\u6a4b \u656c\u9686\uff08NTT\u30de\u30eb\u30c1\u30e1\u30c7\u30a3\u30a2\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u7814\u7a76\u6240\uff09\uff0c\u9ad8\u6a4b \u8c4a\uff08\u5948\u826f\u5148\u7aef\u79d1\u5b66\u6280\u8853\u5927\u5b66\u9662\u5927\u5b66\uff09\uff0c\u9577\u8c37\u5ddd \u5229\u6cbb\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Performance improvement of ABT protocols with combined bandwidth\/buffer reservation<br \/>\n\t<br \/>\u963f\u591a \u4fe1\u543e\uff0c\u6edd\u6839 \u54f2\u54c9\uff0c\u6751\u7530 \u6b63\u5e78\uff0c\u5bae\u539f \u79c0\u592b\uff08\u5927\u962a\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Zero points of the determinant for a matrix function by Newton&#8217;s method and an M\/G\/1 type Markov chain<br \/>\n\t<br \/>\u897f\u6751 \u5f70\u4e00\uff0c\u539f\u5cf6 \u539a\u5fd7\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>ATM \u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306b\u3042\u3089\u308f\u308c\u308b\u5b9a\u6642\u5272\u308a\u8fbc\u307f\u30e2\u30c7\u30eb<br \/>\n\t<br \/>\u9752\u91ce \u88d5\u4e00\uff0c\u753a\u539f \u6587\u660e\uff08\u6771\u4eac\u96fb\u6a5f\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>On trying to make things simple<br \/>\n\t<br \/>Ronald W. Wolff\uff08\u6771\u4eac\u90fd\u7acb\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Necessary and sufficient conditions for product\u2212form queueing networks<br \/>\n\t<br \/>\u9ad8\u7530 \u5bdb\u4e4b\uff0c\u5bae\u6ca2 \u653f\u6e05\uff08\u6771\u4eac\u7406\u79d1\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>2\u5c64\u578b\u5f85\u3061\u884c\u5217\u7db2\u30e2\u30c7\u30eb\u306e\u7a4d\u5f62\u5f0f\u8fd1\u4f3c\u3068\u305d\u306e\u7cbe\u5ea6\u691c\u8a3c<br \/>\n\t<br \/>\u8535\u6749 \u4fca\u5eb7\uff0c\u7d00 \u4e00\u8aa0\uff08NEC C&#038;C \u30e1\u30c7\u30a3\u30a2\u7814\u7a76\u6240\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>A limit theorem for the departure process of a MAP\/M\/c queue and its application to tandem queues<br \/>\n\t<br \/>\u7267\u672c \u76f4\u6a39\uff0c\u52a0\u85e4 \u61b2\u4e00\uff08\u6771\u4eac\u5de5\u696d\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>On the optimal Markov chain of IS simulation<br \/>\n\t<br \/>\u4e2d\u5ddd \u5065\u6cbb\uff08\u9577\u5ca1\u6280\u8853\u79d1\u5b66\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>G\/G\/1 \u5f85\u3061\u884c\u5217\u30b7\u30b9\u30c6\u30e0\u306b\u304a\u3051\u308b\u5b9a\u5e38\u72b6\u614b\u3067\u306e\u89e3\u6790\u624b\u6cd5\u306b\u3064\u3044\u3066<br \/>\n\t<br \/>\u5409\u5ca1 \u826f\u96c4\uff08\u5f18\u524d\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Extremal auto-correlated arrival processes<br \/>\n\t<br \/>\u8c4a\u6cc9 \u6d0b\uff08NTT\u30de\u30eb\u30c1\u30e1\u30c7\u30a3\u30a2\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u7814\u7a76\u6240\uff09\uff0cJ. George Shanthikumar\uff08Univ. of California Berkeley\uff09\uff0cRonald W. Wolff\uff08\u6771\u4eac\u90fd\u7acb\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Performance analysis of a two-queue model with a (M,N)-threshold nonpreemptive priority service schedule<br \/>\n\t<br \/>\u99ae  \u5049\uff0c\u5c0f\u548c\u7530 \u6b63\uff0c\u5b89\u9054 \u516c\u4e00\uff08\u540d\u53e4\u5c4b\u5de5\u696d\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Trunk reservation effects for multi-server system with batch arrivals of loss and delay customers<br \/>\n\t<br \/>\u6cb3\u897f \u61b2\u4e00\uff0c\u9ad8\u6a4b \u656c\u9686\uff0c\u7af9\u4e2d \u8c4a\u6587\uff08NTT\u30de\u30eb\u30c1\u30e1\u30c7\u30a3\u30a2\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u7814\u7a76\u6240\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Bounds for the tail distribution in a queue with a superposition of general periodic Markov sources: Theory and application<br \/>\n\t<br \/>\u77f3\u5d0e \u6587\u96c4\uff08\u5fb3\u5cf6\u5927\u5b66\uff09\uff0c\u6edd\u6839 \u54f2\u4e5f\uff08\u5927\u962a\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Weak stationary solution of a G\/G\/1\/\u221e queue Controlled by IPA-based SA with constant stepsize<br \/>\n\t<br \/>\u4e09\u597d \u76f4\u4eba\uff08\u4eac\u90fd\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>Heuristic policies for resource allocation in assembly-like queueing systems<br \/>\n\t<br \/>\u5b8b \u5b87\uff08\u798f\u5ca1\u5de5\u696d\u5927\u5b66\uff09\n\t<\/p>\n<\/ul>\n<ul>\n<li>\u5f85\u3061\u884c\u5217\u7814\u7a76\u306e\u30c1\u30e3\u30ec\u30f3\u30b8 &#8211; \u5ea7\u8ac7\u4f1a\u8a18\u9332\n\t<\/p>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>1997\u5e74\u5ea6\uff08\u7b2c16\u56de\uff09\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0 &#8220;\u60c5\u5831\u901a\u4fe1\u30cd\u30c3\u30c8\u30ef\u30fc\u30af\u306e\u65b0\u3057\u3044\u6027\u80fd\u8a55\u4fa1\u6cd5\u306b\u95a2\u3059\u308b\u7dcf\u5408\u7684\u7814\u7a76&#8221; \u65e5\u6642: 1998\u5e741\u670819-21\u65e5 \u5834\u6240: \u4eac\u90fd\u30fb\u30b3\u30df\u30e5\u30cb\u30c6\u30a3\u5d6f\u5ce8\u91ce\uff08\u4eac\u90fd\u5e9c\u52e4\u52b4\u8005\u7814\u4fee\u30bb\u30f3\u30bf\u30fc\uff09 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":24,"menu_order":41,"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\/192"}],"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=192"}],"version-history":[{"count":2,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/192\/revisions"}],"predecessor-version":[{"id":233,"href":"https:\/\/orsj.org\/queue\/wp-json\/wp\/v2\/pages\/192\/revisions\/233"}],"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=192"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}