Comparing an Approximate Queuing Approach with Simulation for the Solution of a Cross-Docking Problem

<div>Phase between instant zero and instant <svg height="11.1049pt" id="M23" style="vertical-align:-3.29108pt" version="1.1" viewbox="-0.0498162 -7.81382 9.43046 11.1049" width="9.43046pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z" id="g113-117"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="341" vert-adv-y="341"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,4.368,3.132)"><path d="M245 635C92 635 37 457 37 312C37 149 91 -12 244 -12C395 -12 449 166 449 312C449 469 395 635 245 635ZM243 598C332 598 358 454 358 312C358 173 334 26 245 26C158 26 128 174 128 313S152 598 243 598Z" id="g50-49"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg>, when there is practically no queue.</div>

Journal of Applied Mathematics

fig3

Figure 3

Figure 3: Comparing an Approximate Queuing Approach with Simulation for the Solution of a Cross-Docking Problem 