Simulation analysis of applicant scheduling and processing alternatives at a military entrance processing station

Phillip M. LaCasse, L. Champagne, Jonathan M Escamilla
{"title":"Simulation analysis of applicant scheduling and processing alternatives at a military entrance processing station","authors":"Phillip M. LaCasse, L. Champagne, Jonathan M Escamilla","doi":"10.1177/15485129221134536","DOIUrl":null,"url":null,"abstract":"Eligibility for enlistment into the US military is assessed by the United States Military Entrance Processing Command (USMEPCOM), an independent agency that reports to the Office of the Secretary of Defense (OSD) and not to any specific branch of military service. This research develops a discrete-event simulation for applicant processing operations at a Military Entrance Processing Station (MEPS) to investigate the viability of potential alternatives to the current applicant arrival and processing operation. Currently, all applicants arrive to the MEPS at the beginning of the processing day in a single batch. This research models and compares two alternatives with the status quo: split-shift processing, by which applicant arrivals occur in two batches: one at 06:00 and one at 11:00 and appointment-based processing, by which applicants may arrive during one of three, four, six, or eight appointment windows. Express-lane processing is also explored, in which applicants are allowed to bypass select processing stations. Experimental results indicate that split-shift processing is not viable under the current processing model due to an unacceptable decrease in applicant throughput. Results from appointment-based scenarios are mixed, with the critical factors being the time between appointment batches and their associated arrival times.","PeriodicalId":44661,"journal":{"name":"Journal of Defense Modeling and Simulation-Applications Methodology Technology-JDMS","volume":"79 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2022-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Defense Modeling and Simulation-Applications Methodology Technology-JDMS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1177/15485129221134536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Eligibility for enlistment into the US military is assessed by the United States Military Entrance Processing Command (USMEPCOM), an independent agency that reports to the Office of the Secretary of Defense (OSD) and not to any specific branch of military service. This research develops a discrete-event simulation for applicant processing operations at a Military Entrance Processing Station (MEPS) to investigate the viability of potential alternatives to the current applicant arrival and processing operation. Currently, all applicants arrive to the MEPS at the beginning of the processing day in a single batch. This research models and compares two alternatives with the status quo: split-shift processing, by which applicant arrivals occur in two batches: one at 06:00 and one at 11:00 and appointment-based processing, by which applicants may arrive during one of three, four, six, or eight appointment windows. Express-lane processing is also explored, in which applicants are allowed to bypass select processing stations. Experimental results indicate that split-shift processing is not viable under the current processing model due to an unacceptable decrease in applicant throughput. Results from appointment-based scenarios are mixed, with the critical factors being the time between appointment batches and their associated arrival times.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
某军事入口处理站申请人调度及处理方案仿真分析
加入美国军队的资格是由美国军事入境处理司令部(USMEPCOM)评估的,这是一个独立的机构,向国防部长办公室(OSD)报告,而不是向任何特定的军事服务部门报告。本研究针对军事入境处理站(MEPS)的申请人处理操作开发了一个离散事件模拟,以调查当前申请人到达和处理操作的潜在替代方案的可行性。目前,所有申请人在处理日开始时都以单批方式到达MEPS。本研究对现状的两种选择进行了建模和比较:分班处理,申请人分两批到达:一批在06:00,另一批在11:00;基于预约的处理,申请人可以在三个、四个、六个或八个预约窗口中的一个到达。还探索了快速通道处理,允许申请人绕过选定的处理站。实验结果表明,由于申请人吞吐量的不可接受的下降,在当前的处理模型下,分班处理是不可行的。基于预约的场景的结果是混合的,关键因素是预约批次之间的时间和它们相关的到达时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.80
自引率
12.50%
发文量
40
期刊最新文献
Modeling fog and friction in military enterprise Adapting military doctrine in the shadow of the future Modeling of Russian–Ukrainian war based on fuzzy cognitive map with genetic tuning Decision-making in the shadow of strategic competition costs Multiple UAVs on a shared tether: Use cases, modeling, and probabilistic path planning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1