A technique for allocating resources from multiple resource pools. It shows how to choose a pool from which to draw a resource, based on given criteria.
The Dining Philosophers problem is a classical problem, originally formulated by E.W. Dijkstra, to demonstrate classical problems in computer science and the programming of concurrent
Model and optimize the use of shared resources in a system, to identify resource deficiencies and improve capacity planning. The example is based on a batch production process, where
A production system that uses kanbans to manage production activities. Analysis of simulation results highlights problems in the system and suggests ways to improve its performance.
Model a manufacturing plant. The plant consists of an assembly line that processes jobs based on a pre-determined schedule. This example walks you through a workflow for: