Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Διακριτή Προσομοίωση Γεγονότων (DES)× | Ουρά M/M/1: Το Μοντέλο Ουράς Μοναδικού Εξυπηρετητή× | |
|---|---|---|
| Πεδίο≠ | Προσομοίωση | Επιχειρησιακή Έρευνα |
| Οικογένεια≠ | Process / pipeline | Regression model |
| Έτος προέλευσης≠ | 1960s (formalized); modern computational form from 1970s onward | 1953 |
| Δημιουργός≠ | Banks, Carson, Nelson & Nicol (textbook lineage); foundational work by Tocher & Conway (1960s) | A. K. Erlang; David Kendall (notation) |
| Τύπος≠ | Stochastic process simulation | Stochastic queueing model |
| Θεμελιώδης πηγή≠ | Banks, J., Carson, J.S., Nelson, B.L. & Nicol, D.M. (2010). Discrete-Event System Simulation (5th ed.). Pearson. ISBN: 978-0136062127 | Kendall, D. G. (1953). Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. The Annals of Mathematical Statistics, 24(3), 338–354. DOI ↗ |
| Εναλλακτικές ονομασίες≠ | DES, event-driven simulation, Ayrık Olay Simülasyonu (DES) | Single-Server Markovian Queue, Birth-Death Queue, Poisson Queue, M/M/1 Kuyruk Modeli |
| Συναφείς≠ | 4 | 3 |
| Σύνοψη≠ | Discrete-Event Simulation (DES) is a computational modeling paradigm in which the state of a system changes only at a countable sequence of points in time — the events. Between events nothing changes, so the simulation clock jumps directly from one event to the next. Formalized through the foundational textbooks of Banks, Carson, Nelson and Nicol and of Law in the 1960s–2000s, DES has become the standard tool for analyzing queuing systems, healthcare patient flows, manufacturing lines, and logistics networks where entities move through resources over time. | The M/M/1 queue is the foundational single-server queueing model in which customers arrive according to a Poisson process with rate λ, are served one at a time by a single server with exponentially distributed service times at rate μ, and wait in an infinite-capacity first-come-first-served queue. Formalized within the Kendall notation framework by David Kendall in 1953, building on A. K. Erlang's early twentieth-century telephone traffic work, it yields closed-form steady-state performance measures when the traffic intensity ρ = λ/μ is less than one. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|