期刊文献+

基于M/M/S的高校餐厅配餐模型研究与应用

Research and application of catering model in college restaurant based on M/M/S
下载PDF
导出
摘要 针对高校餐厅学生就餐问题,提出了基于排队论的等待制模型。首先通过对高校学生到达餐厅就餐情况以及餐厅工作人员工作情况的调查,确定高校学生愿意在餐厅就餐最短排队等待时间,餐厅服务台工作人员平均服务速率;其次利用M/M/S等待制模型,建立餐厅所需服务台人员最少人数模型minS,在此基础上,通过有序二元比较量化法确定餐厅各工作的权重系数,并由此来量化分配各工作所需人员人数;进而结合指派模型,使用匈牙利算法确定总工作所需最少人数,并进行合理化分工;最后,利用该模型设计开发了食堂点餐的手机应用,并在高校内试运行。 Aiming at the dining problem of college students in restaurants,a waiting system model based on queuing theory is proposed.Firstly,through the investigation of college students’arrival and the working conditions of restaurant staff,the shortest waiting time and average service rate of restaurant staff are determined.Secondly,using M/M/S waiting system model,the minimum number of desk staff model min S is established.On this basis,an orderly binary ratio is adopted.Quantitative method is used to determine the weight coefficients of restaurant work,and then to quantify the number of people needed for each job.Finally,combined with the assignment model,Hungarian algorithm is used to determine the minimum number of people needed for the total work and to rationalize the division of labor.Finally,this model is used to design and develop the campus ordering mobile phone application,which is tested in colleges and universities.
作者 徐啊俊 陈志荣 XU A-jun;CHEN Zhi-rong(Ningbo University of Technology,Ningbo 315211,Zhejiang Province,China)
机构地区 宁波工程学院
出处 《信息技术》 2019年第8期29-32,36,共5页 Information Technology
基金 浙江省自然科学基金(LY18E050015) 浙江省大学生科技创新活动计划暨新苗人才计划项目(2018R428029)
关键词 M/M/S 指派模型 匈牙利算法 点餐APP M/M/S assignment model hungarian algorithm order APP
  • 相关文献

参考文献3

二级参考文献14

  • 1崔梦天,张世禄,赵海军.基于排队的方法解决分布式系统中信息资源的问题[J].情报杂志,2005,24(3):45-47. 被引量:4
  • 2崔宝江,刘军,王刚,刘璟.网络存储系统I/O响应时间边界性能研究[J].通信学报,2006,27(1):69-74. 被引量:5
  • 3周薇,罗荣桂,田磊.排队论在计算机存储系统性能中的应用和分析[J].微计算机信息,2006,22(07X):271-272. 被引量:5
  • 4Luyp David. Performance study of Iscsi based storage subsystems[J]. IEEE Communications Magazine, 2003,41(8): 76-82.
  • 5Hexb, Beedanagari, Zhou D. Performance evaluation of distributed iSCSI RAID[C]//Proceedings of the 2003 IEEE/ACM International Workshop on Storage Network Architecture and Parallel I/O(SNAPI'03). New Orleans..2003.
  • 6Weetn, Hillyer, Shriver E. Obtaining high performance for storage outsourcing[C]//Procee-dings of Conference on File and Storage Technologies (FAST'02). Monterey, California: 2002 : 145-158.
  • 7MarcFarley.SAN存储区域网络[M].2版.孙功星,蒋文保,范勇,等译.北京:机械工业出版社,2002:12-34.
  • 8Phillips B. Have storage area networks come of age. Computer[J]. 1998,31(7):10-12.
  • 9徐玖平,胡知能,李军.运筹学Ⅱ类[M].北京:科学出版社,2004:247-275.
  • 10O'Sullivan M, Walker C, Allard J. Improving Optimal Storage Area Network Design[C]//ORSNZ Conference Twenty Naught Two. New Zealand,2002 : 119-128.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部