Process flexibility revisited: the graph expander and its applications
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1696537
- scientific article; zbMATH DE number 2081021
- Process flexibility: design, evaluation, and applications
- scientific article; zbMATH DE number 5180
- A graph-theoretical approach to configuration processing
- Approximating schedules for dynamic process graphs efficiently
- Application of digraph theory to process scheduling
- Expander graphs and their applications
- Constrainted graph processes
Cited in
(21)- Flexible system design: a perspective from service levels
- Analyzing process flexibility: a distribution-free approach with partial expectations
- An improved L-shaped method for solving process flexibility design problems
- Optimal distribution (re)planning in a centralized multi-stage supply network under conditions of the ripple effect and structure dynamics
- Optimal sparse designs for process flexibility via probabilistic expanders
- Dynamic capacity management with general upgrading
- Joint inventory and markdown management for perishable goods with strategic consumer behavior
- On the performance of sparse process structures in partial postponement production systems
- Worst-case analysis of process flexibility designs
- Hub and chain: process flexibility design in non-identical systems using variance information
- Process flexibility: a distribution-free bound on the performance of k-chain
- A new approach for vehicle routing with stochastic demand: combining route assignment with process flexibility
- Optimal Design of Process Flexibility for General Production Systems
- Process flexibility for multiperiod production systems
- Towards dominant flexibility configurations in strategic capacity planning under demand uncertainty
- The impact of demand uncertainty on product line design under endogenous substitution
- Compensating for dynamic supply disruptions: backup flexibility design
- Sparse process flexibility designs: Is the long chain really optimal?
- Resilience of long chain under disruption
- Disconnectedness brings robustness? On network design for matching with vertex interdiction
- Approximation algorithms for k-scenario matching
This page was built for publication: Process flexibility revisited: the graph expander and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879505)
