Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Діаграма блоків надійності× | Планування виробничих завдань (Job Shop Scheduling)× | |
|---|---|---|
| Галузь | Операційний менеджмент | Операційний менеджмент |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2010 | 2016 |
| Автор методу≠ | Ebeling, C. E. | Pinedo, M. L. |
| Тип≠ | Reliability analysis technique | Combinatorial scheduling problem |
| Основоположне джерело≠ | Ebeling, C. E. (2010). An introduction to reliability and maintainability engineering (2nd ed.). Long Grove, IL: Waveland Press. link ↗ | Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems (5th ed.). Cham: Springer. DOI ↗ |
| Інші назви | RBD, reliability analysis | job scheduling, machine scheduling |
| Пов'язані | 5 | 5 |
| Підсумок≠ | A Reliability Block Diagram (RBD) is a visual representation of a system's architecture that models how component reliabilities combine to determine overall system reliability. Each block represents a component or subsystem with a known reliability (probability of functioning without failure), and connections between blocks represent functional relationships (series, parallel, or mixed). RBD analysis is a fundamental tool in reliability engineering, used to identify critical components, optimize redundancy, and predict system-level failure rates. | Job shop scheduling is the problem of assigning a set of jobs (tasks) to a set of machines (resources) over time, subject to precedence and capacity constraints, with the goal of optimizing performance metrics such as makespan (total completion time), lateness, or cost. The job shop problem is a classic combinatorial optimization problem in operations research, addressed through heuristics (greedy dispatching rules, simulated annealing, genetic algorithms) and exact algorithms (branch-and-bound, constraint programming). It is fundamental to manufacturing, project management, and computational scheduling. |
| ScholarGateНабір даних ↗ |
|
|