A gradient search and column generation approach for the build–pack planning problem with approved vendor matrices and stochastic demand

DOI10.1080/00207540903049381zbMath1197.90035OpenAlexW2165722136MaRDI QIDQ3163170

No author found.

Publication date: 25 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540903049381

zbMATH Keywords

simulationgenetic algorithmsinventory controlevolutionary algorithmslogisticsdispatching rulescycle time reductionsimulation theory

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Cites Work

• Production planning with approved vendor matrices for a hard-disk drive manufacturer
• Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands
• Managing Broader Product Lines through Delayed Differentiation Using Vanilla Boxes
• A Linear Programming Approach to the Cutting-Stock Problem
• Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
• Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
• Stochastic programming in production planning: a case with none-simple recourse
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• A Modified Linear Program for Columnar Methods in Mathematical Programming

This page was built for publication: A gradient search and column generation approach for the build–pack planning problem with approved vendor matrices and stochastic demand