Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms (Q6588151)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms |
scientific article; zbMATH DE number 7897445
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms |
scientific article; zbMATH DE number 7897445 |
Statements
Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms (English)
0 references
15 August 2024
0 references
reliable production process design problem
0 references
MILP-model
0 references
branch-and-bound method
0 references
adaptive large neighborhood search heuristic
0 references
0 references
0 references
0 references
0 references
0 references
