Abstract
PurposeTo have all the required components of batches of product orders ready for timely assembly and delivery, the real time wood strip cutting patterns in a major solid wood furniture manufacturing plant has to be dynamically generated based on both the order priority and the minimum wood waste.Design/methodology/approachAn adaptive fuzzy ranking method and a recursive function for pattern generation were integrated into an optimization procedure to solve the real time one‐dimensional multiple‐grade cutting stock problem when orders are prioritized.FindingsThe simulation results illustrate that the optimization algorithm produce considerably less waste than the current approach. If implemented in the industry, the saving in raw material could be in the range of 5‐10 percent.Research limitations/implicationsThe optimization algorithm is for the cut‐to‐size decisions only with the consideration of the order priorities. The overall scheduling of the production shop floor is not addressed.Practical implicationsThe algorithm can be used on the cutting machines as an online patterns generator and cutting optimizer.Originality/valueThere is no literature available for the real time one‐dimensional multiple‐grade cutting stock problem when orders are prioritized. The few commercial optimizers have unknown algorithms with unpredictable waste.
Subject
Industrial and Manufacturing Engineering,Control and Systems Engineering
Reference15 articles.
1. Belov, G. and Scheithauer, G. (2002), “A cutting plane algorithm for the one‐dimensional cutting stock problem with multiple stock lengths”, European Journal of Operational Research, Vol. 141, pp. 274‐94.
2. Cizman, A. and Cernetic, J. (2004), “Improving competitiveness in veneers production by a simple‐to‐use DSS”, European Journal of Operational Research, Vol. 156, pp. 241‐60.
3. Ghodsi, R. and Sassani, F. (2002), “An adaptive fuzzy algorithm for cut sequencing of solid wood in furniture component production”, Proceedings of the IEEE International Symposium on Intelligent Control, Vancouver, pp. 246‐51.
4. Ghodsi, R. and Sassani, F. (2003), “A fast recursive algorithm for cut sequencing optimization”, Proceedings of the International Conference on Managing Innovative Manufacturing, Aalborg, pp. 111‐18.
5. Gradisar, M. and Trkman, P. (2004), “A combined approach to the solution to the general one‐dimensional cutting stock problem”, Computers and Operations Research (in press)..
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献