网站大量收购独家精品文档,联系QQ:2885784924

管理科学13-排队论(等候理论).ppt

  1. 1、本文档共57页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Chapter 13 - Queuing Analysis Metro Quick Lube single bay service; space for one vehicle in service and three waiting for service; mean time between arrivals of customers is 3 minutes; mean service time is 2 minutes; both inter-arrival times and service times are exponentially distributed; maximum number of vehicles in the system equals 4. Operating characteristics for ? = 20, ? = 30, M = 4: Finite Queue Length Example (1 of 2) Average queue lengths and waiting times: Finite Queue Length Example (2 of 2) Exhibit 13.6 Finite Queue Model Example Solution with Excel Exhibit 13.7 Finite Queue Model Example Solution with QM for Windows In a finite calling population there is a limited number of potential customers that can call on the system. Operating characteristics for system with Poisson arrival and exponential service times: Finite Calling Population Wheelco Manufacturing Company; 20 machines; each machine operates an average of 200 hours before breaking down; average time to repair is 3.6 hours; breakdown rate is Poisson distributed, service time is exponentially distributed. Is repair staff sufficient? ? = 1/200 hour = .005 per hour ? = 1/3.6 hour = .2778 per hour N = 20 machines Finite Calling Population Example (1 of 2) System seems inadequate. Finite Calling Population Example (2 of 2) Exhibit 13.8 Finite Calling Population Example Solution with Excel and Excel QM (1 of 2) Exhibit 13.9 Finite Calling Population Example Solution with Excel and Excel QM (2 of 2) Exhibit 13.10 Finite Calling Population Example Solution with QM for Windows In multiple-server models, two or more independent servers in parallel serve a single waiting line. Biggs Department Store service department; first-come, first-served basis. Multiple-Server Waiting Line (1 of 2) Figure 13.3 Customer Service Queuing System Multiple-Server Waiting Line (2 of 2) Multiple-Server Waiting Line Queuing Formulas (1 of 3) Assumptions: First-come first-served queue discipline Poisson a

您可能关注的文档

文档评论(0)

开心就好 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档