Heuristic decomposition approach to buffer operation planning in a production process
DOI10.1080/00207729008910399zbMATH Open0715.90060OpenAlexW2130893386MaRDI QIDQ3202124FDOQ3202124
Authors: Nobuo Sannomiya, Chisaku Onishi, Hiroyuki Yoshino
Publication date: 1990
Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207729008910399
Recommendations
- Heuristic algorithms for buffer allocation in a production line with unreliable machines
- Analysis of serial production lines: characterisation study and a new heuristic procedure for optimal buffer allocation
- A Benders decomposition based heuristic for the hierarchical production planning problem
- A general heuristic for production planning problems
- A heuristic algorithm for a production planning problem in an assembly system
- Improved heuristic methods for multiple stage production planning.
- Hybrid approach for buffer allocation in open serial production lines
- A heuristic algorithm for allocation of components in manufacturing processes
- A new heuristic and an exact approach for a production planning problem
Applications of mathematical programming (90C90) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) Production models (90B30)
Cites Work
Cited In (2)
This page was built for publication: Heuristic decomposition approach to buffer operation planning in a production process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3202124)