A vulcanising decision planning as a particular one-dimensional cutting stock problem with limited part-related tooling in make-to-order industrial environments

References

• Aktin, T., and R. G. Özdemir. 2009. “An Integrated Approach to the One-dimensional Cutting Stock Problem in Coronary Stent Manufacturing.” European Journal of Operational Research 196: 737–743.
   Web of Science ®Google Scholar
• Araujo, S. A., A. A. Constantino, and K. C. Poldi. 2010. “An Evolutionary Algorithm for the One-dimensional Cutting Stock Problem.” International Transactions in Operational Research 18: 115–127.
   Web of Science ®Google Scholar
• Arbib, C., and F. Marinelli. 2014. “On Cutting Stock with Due Dates.” Omega 46: 11–20.
   Web of Science ®Google Scholar
• Belov, G., A. N. Letchford, and E. Uchoa. 2005. “A Net-flow model for 1D Stock Cutting: Robust Branch-cut-and-price.” Technical report. Institute of Numerical Mathematics, Technische Universitat Dresden. 10 April 1–14.
   Google Scholar
• Belov, G., and G. Scheithauer. 2007. “Setup and Open-stacks Minimization in One-dimensional Stock Cutting.” Informs Journal on Computing 19 (1): 27–35.
   Web of Science ®Google Scholar
• Brandao, F., and J. P. Pedroso. 2013. “Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression.” Technical Report Series: DCC-2013-08 Universidad Do Porto 2–29.
   Google Scholar
• Cherri, A. C., M. N. Arenales, H. H. Yanasse, K. C. Poldi, and A. C. G. Vianna. 2014. “The one-dimensional cutting stock problem with usable leftovers-A survey.” European Journal of Operational Research 236: 395–402.
   Web of Science ®Google Scholar
• Cui, Y., and Z. Liu. 2011. “C-set Based Sequential Heuristic Procedure for the One-dimensional Cutting Stock Problem with Patter Reduction.” Optimization Methods & Software 26 (1): 155–167.
   Web of Science ®Google Scholar
• Fowler, J. W., G. L. Hogg, and D. T. Phillips. 1992. “Control of Multi Product Bulk Service Diffusion/Oxidation Process.” IIE Transactions 24: 84–96.
   Web of Science ®Google Scholar
• Gilmore, P. C., and R. E. Gomory. 1961. “A Linear Programming Approach to the Cutting-stock Problem.” Operations Research 9 (6): 849–859.
   Web of Science ®Google Scholar
• Gilmore, P. C., and R. E. Gomory. 1963. “A Linear Programming Approach to the Cutting-stock Problem Part II.” Operations Research 11: 863–888.
   Web of Science ®Google Scholar
• Goldratt, E. M. 2009. “Standing on the Shoulders of Gigants-production Concepts versus Production Applications.” The Hitachi Tool Engineering example, Gestão and Producão, São Carlos 16 (3): 333–343.
   Google Scholar
• Goldratt, E. M., and J. Cox. 2014. The Goal, a Process Ongoing Improvement. 3rd ed. Great Barrington, MA: The North River Press publishing Corporation.
   Google Scholar
• Jacobs, F. R., and R. B. Chase. 2011. Operations and Supply Chain Management. 13th ed. New York: McGraw Hill.
   Google Scholar
• Kallrath, J., S. Rebennack, J. Kallrath, and R. Kusche. 2014. “Solving Real-world Cutting Stock-problems in the Paper Industry: Mathematical Approaches, Experience and Challenges.” European Journal of Operational Research 238: 374–389.
   Web of Science ®Google Scholar
• Kartak, V. M., A. V. Ripatti, G. Scheitauer, and S. Kurtz. 2014. “Minimal Proper Non-IRUP Instances of the One-dimensional Cutting Stock Problem.” Discrete Applied Mathematics 187: 120–129.
   Web of Science ®Google Scholar
• Kellerer, H., U. Pferschy, and D. Psinger. 2010. Knapsack Problems. Berlin-Heidelberg: Springer-Verlag.
   Google Scholar
• Koch, J., C. Plehn, G. Reinhart, and M. F. Zäh. 2014. “Cycle Management for Continuous Manufacturing Planning.” In Enabling Manufacturing Competitiveness and Economic Sustainability Proceedings of the 5th International Conference on Changeable, Agile, Reconfigurable and Virtual Production (CARV 2013), edited by M. F. Zaeh, 9–12. Munich, Germany. ISBN: 978-3-319-02053-2 (Print) 978-3-319-02054-9 (Online).
   Google Scholar
• Lakshminarayanan, B. 2008. “High Reliability Miniature RF-MEMS. Switched Capacitors.” Microwave Theory and Techniques IEEE Transactions 56 (4): 971–981.
   Web of Science ®Google Scholar
• López, H. 2001. "Algoritmo para el diseño óptimo de carros de vulcanizado utilizando programación lineal con un número infinito de variables [Thesis Submitted in Spanish: Algorithm for the Optimal Vulcaniser Cart Design Using Linear Programming With Infinite Number of Variables].” Master’s thesis. ITESM -- Campus Toluca, México.
   Google Scholar
• Mathirajan, M., V. Chandru , and A. I. Sivakumar. 2007. “Heuristic Algorithms for Scheduling Heat-treatment Furnaces of Steel Casting Industries.” S\={a}dhan\={a} 32 (5): 479–500.
   Google Scholar
• Matsumoto, K., S. Umetani, and H. Nakamochi. 2011. “On the One-dimensional Stock Cutting Problem in the Paper Industry.” Journal of Scheduling 14: 281–290.
   Web of Science ®Google Scholar
• Monden, Y. 2012. Toyota Production System, an Integrated Approach to Just-in-time. 4th ed. Boca Raton, FL: CRC Press.
   Google Scholar
• Nemhauser, G. L., and L. A. Wolsey. 1988. Integer and Combinatorial Optimization, New York: John Wiley and Sons.
   Google Scholar
• Pinedo, M. 2012. Scheduling; Theory, Algorithms, and Systems. 4th ed. New York: Springer.
   Google Scholar
• Reinertsen, H., and T. W. M. Vossen. 2010. “The One-dimensional Cutting Stock Problem with Due Dates.” European Journal of Operations Research. 201: 701–711.
   Web of Science ®Google Scholar
• Rietz, J., and S. Dempe. 2008. “Large Gaps in One-dimensional Cutting Stock Problems.” Discrete Applied Mathematics 156: 1929–1935.
   Web of Science ®Google Scholar
• Rockafellar, R. T. 1998. Network Flows and Monotropic Optimization. Belmont, MA: Athena scientific.
   Google Scholar
• Scheithauer, G., J. Temo, A. Müller, and G. Belov. 2001. “Solving One-dimensional Cutting Stock Problems Exactly with a Cutting Plane Algorithm.” Journal of the Operational Research Society 52: 1390–1401.
   Web of Science ®Google Scholar
• Sweeney, P. E., and R. W. Haessler. 1990. “One-dimensional Cutting Stock Decisions for Rolls with Multiple Quality Grades.” European Journal of Operational Research 44: 224–231.
   Web of Science ®Google Scholar
• Tang, L., G. Wang, and Z. L. Chen. 2014. “Integrated Charge Batching and Casting width Selection at Baosteel.” Operations Research 62 (4): 772–787.
   Web of Science ®Google Scholar
• Toscano, A., S. Rangel, and H. H. Yanasse. 2015. “A Heuristic Approach to Minimize the Number of Saw Cycles in Small-scale Furniture Factories.” Annals of Operations Research 1–28.
   Google Scholar
• Trkman, P., J. Erjavec, and M. Gradisar. 2009. “Cutting as a Continuous Business Process.” Economic and Business Review for Central and South-Eastern Europe 11 (4): 285–340.
   Google Scholar
• Uzsoy, R., C. H. Lee, and L. A. Martin-Vega. 1992. “Scheduling Semiconductor Test Operations: Minimizing Maximum Lateness and Number Tardy Jobs on a Single Machine.” Naval Research Logistics 39: 369–388.
   Web of Science ®Google Scholar
• Valério de Carvalho, J. M. 2002. “LP Models for Bin Packing and Cutting Stock Problems.” European Journal of Operational Research 141 (2): 253–273.
   Web of Science ®Google Scholar
• Varela, R., C. R. Vela, J. Puente, M. Sierra, and I. González-Rodríguez. 2009. “An Effective Solution for a Real Cutting-stock Problem in Manufacturing Plastic Rolls.” Annals of Operational Research 166: 125–146.
   Web of Science ®Google Scholar
• Vanderbeck, F. 1999. “Exact Algorithm for Minimizing the Number of Set-ups in the One-dimensional Cutting Stock Problem.” Operations Research 48 (6): 915–926.
   Web of Science ®Google Scholar
• Wyne, B. N. 2004. Accelerated Testing: Statistical Models, Test Plans and Data Analysis. Hoboken NJ: John Wiley and Sons.
   Google Scholar
• Wäscher, G., H. Haussner, and H. Schumann. 2007. “An Improved Typology of Cutting and Packing Problems.” European Journal of Operational Research 183: 1109–1130.
   Web of Science ®Google Scholar
• Zee, D. J., A. Van Harten, and P. C. Schuur. 1997. “Dynamic Job Assignment Heuristics for Multi-server Batch Operations - A Cost Based Approach.” International Journal of Production Research 35 (11): 3063–3093.
   Web of Science ®Google Scholar