Synopsis
Now you can use discrete simulation to model scheduling that is too complex for direct analysis. How many bags of beans must a grocer keep on the shelf? When does an intersection need a stoplight? Programming Discrete Simulations provides statistical computer models to understand these scheduling and inventory tasks.
Moshe Pollatschek adroitly bridges between explaining sound statistical principles and solving real-world problems with modeling. Here are practical explanations of discrete simulation. Fifteen examples range from simple telephone queue scheduling to a complex assembly task involving parts scheduling and component matching.
You also get a useful set of tools for writing discrete simulation programs - the Simulation Subroutine Set. The companion code disk includes the library and all the examples.
The Simulation Subroutine Set library and all example simulations are coded in C. An appendix summarizes the parallel constructions for FORTRAN, BASIC, and Pascal.
Pollatschek clearly advises you how to avoid bad programming choices, explaining the interactions between programming methods and statistical analysis. The mathematical explanations are kept straightforward, while still introducing sophisticated concepts. The math understanding required of the reader is comparable to algebra.
"synopsis" may belong to another edition of this title.
Synopsis
This work offers a practical explanation of discrete simulation and provides a set of tools for writing discrete simulation programs.
"About this title" may belong to another edition of this title.
