{"created":"2023-05-15T14:21:39.640175+00:00","id":3394,"links":{},"metadata":{"_buckets":{"deposit":"a822c8a6-f90c-461e-b71e-3576a4005e6e"},"_deposit":{"created_by":3,"id":"3394","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"3394"},"status":"published"},"_oai":{"id":"oai:bunkyo.repo.nii.ac.jp:00003394","sets":["1:26:197"]},"author_link":["4369"],"item_5_biblio_info_13":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1992-01-01"},"bibliographicPageEnd":"141","bibliographicPageStart":"133","bibliographicVolumeNumber":"13","bibliographic_titles":[{"bibliographic_title":"情報研究"},{"bibliographic_title":"Information and Communication Studies"}]}]},"item_5_date_43":{"attribute_name":"作成日","attribute_value_mlt":[{"subitem_date_issued_datetime":"2012-01-17"}]},"item_5_description_12":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"　有限待ち行列において,ボアソン到着,指数分布サービス,能力の異なる複数serverの待ち行列システムについて,定常状態におけるシステム内の状態確率を求めるアルゴリズムを示す。また,これをもとにして,server数2及び3の場合serverの能力の一定にしたとき,平均系内人数を最小にするserverの能力分布について検討する。\n　This paper deals with the heterogeneous server finite source queuing system with exponential interarrival time and exponential service time, and we develop the computing algorithm to find stationary probability is shown. Using the above result, in the case of two or three servers stationary probability is calculated. In these cases, the problem of searching for the ability ratio of servers to minimize the expected number in the system is studied.","subitem_description_type":"Abstract"}]},"item_5_description_38":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_5_source_id_19":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"03893367"}]},"item_5_text_39":{"attribute_name":"本文言語","attribute_value_mlt":[{"subitem_text_value":"日本語"}]},"item_5_text_42":{"attribute_name":"ID","attribute_value_mlt":[{"subitem_text_value":"BKSJ130011"}]},"item_5_text_7":{"attribute_name":"Author","attribute_value_mlt":[{"subitem_text_value":"Takeda, Hitoshi"}]},"item_5_text_8":{"attribute_name":"所属機関","attribute_value_mlt":[{"subitem_text_value":"文教大学情報学部"}]},"item_5_text_9":{"attribute_name":"Institution","attribute_value_mlt":[{"subitem_text_value":"Bunkyo University Faculty of Information and Communications"}]},"item_5_version_type_35":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"竹田, 仁"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-03-24"}],"displaytype":"detail","filename":"BKSJ130011.pdf","filesize":[{"value":"491.7 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"BKSJ130011.pdf","url":"https://bunkyo.repo.nii.ac.jp/record/3394/files/BKSJ130011.pdf"},"version_id":"ff7e59d7-5fae-4c7e-abca-1f352d84d226"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"能力の異なる複数serverの待ち行列システムの解析(第3報) : 有限入力源待ち行列における平均系内人数の最小化について","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"能力の異なる複数serverの待ち行列システムの解析(第3報) : 有限入力源待ち行列における平均系内人数の最小化について"},{"subitem_title":"The Analysis of Heterogeneous Server Queues (Part III) : Minimization of the Expected Number in the Finite source Queue"}]},"item_type_id":"5","owner":"3","path":["197"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-01-17"},"publish_date":"2012-01-17","publish_status":"0","recid":"3394","relation_version_is_last":true,"title":["能力の異なる複数serverの待ち行列システムの解析(第3報) : 有限入力源待ち行列における平均系内人数の最小化について"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-05-16T14:32:48.894433+00:00"}