Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands
From MaRDI portal
Publication:2433468
DOI10.1016/j.ejor.2005.06.034zbMath1142.90389OpenAlexW2067822586MaRDI QIDQ2433468
Publication date: 27 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.034
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Deterministic network models in operations research (90B10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Production planning with approved vendor matrices for a hard-disk drive manufacturer
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Managing Broader Product Lines through Delayed Differentiation Using Vanilla Boxes
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- A Linear Programming Approach to the Cutting-Stock Problem
- A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming
- Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- Stochastic programming in production planning: a case with none-simple recourse
- Stochastic programs over trees with random arc capacities
- A stochastic linear programming approach to hierarchical production planning
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
