About tooling capacity for the vulcanising planning decision problem to improve strategic business profit

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. doi: 10.1016/j.ejor.2008.04.005
   Web of Science ®Google Scholar
• Arbib, C., and F. Marinelli. 2014. “On Cutting Stock with Due Dates.” Omega 46: 11–20. doi: 10.1016/j.omega.2014.01.004
   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, April 10, 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. doi: 10.1287/ijoc.1050.0132
   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
• Burak, G., B. Hnich, and O. Özpeynirci. 2018. “Parallel Machine Scheduling with Tool Loading: A Constraint Programming Approach.” International Journal of Production Research 56 (16): 5541–5557. doi:10.1080/00207543.2017.1421781
   Web of Science ®Google Scholar
• Carrie, A. S., and D. T. S. Perera. 1986. “Work Scheduling in FMS Under Tool Availability Constraints.” International Journal of Production Research 24 (6): 1299–1308. doi:10.1080/00207548608919804
   Web of Science ®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. doi: 10.1016/j.ejor.2013.11.026
   Web of Science ®Google Scholar
• Cui, Y., and Z. Liu. February, 2011. “C-Set Based Sequential Heuristic Procedure for the 0ne-dimensional Cutting Stock Problem with Pattern Reduction.” Optimization Methods & Software 26 (1): 155–167. doi: 10.1080/10556780903420531
   Web of Science ®Google Scholar
• Durak, B., and D. Tuzun Aksu. 2017. “Dynamic Programming and Mixed Integer Programming Based Algorithms for the Online Glass Cutting Problem with Defects and Production Targets.” International Journal of Production Research 55 (24): 7398–7411. doi:10.1080/00207543.2017.1349951
   Web of Science ®Google Scholar
• Fathi, Y., and K. W. Barnette. 2002. “Heuristic Procedures for the Parallel Machine Problem with Tool Switches.” International Journal of Production Research 40 (1): 151–164. doi:10.1080/00207540110076115
   Web of Science ®Google Scholar
• Garey, M. R., and D. S Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: WH Freemann.
   Google Scholar
• Ghodsi, R., and F. Sassani. 2005. “Real-time Optimum Sequencing of Wood Cutting Process.” International Journal of Production Research 43 (6): 1127–1141. doi: 10.1080/00207540412331299684
   Web of Science ®Google Scholar
• Ghosh, S., S. A. Melnyk, and G. L. Ragatz. 1992. “Tooling Constraints and Shop Floor Scheduling: Evaluating the Impact of Sequence Dependency.” International Journal of Production Research 30 (6): 1237–1253. doi:10.1080/00207549208942954
   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. doi: 10.1287/opre.9.6.849
   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. doi: 10.1287/opre.11.6.863
   Web of Science ®Google Scholar
• Hong, S., H. Zhang, H. C. Lau, X. Zeng, and Y. Si. 2014. “A Hybrid Heuristic Algorithm for the 2D Variable-sized Bin Packing Problem.” European Journal of Operational Research 238 (1): 95–103.1 doi: 10.1016/j.ejor.2014.03.049
   Web of Science ®Google Scholar
• Huang, Y. S., S. A. Wang, and C. C. Fang. 2017. “Optimization of the LCD Optical Film Cutting Problem.” International Journal of Production Research 55 (15): 4411–4435. doi: 10.1080/00207543.2016.1256507
   Web of Science ®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. doi: 10.1016/j.ejor.2014.03.027
   Web of Science ®Google Scholar
• Kim, B. I., Y. Ki, D. Son, B. Bae, and J. S. Park. 2016. “An Algorithm for a Cutting Problem in Window Frame Production.” International Journal of Production Research 54 (14): 4327–4339. doi: 10.1080/00207543.2016.1148279
   Web of Science ®Google Scholar
• Kim, Y. D., G. C. Lee, S. K. Lim, and S. K. Choi. 2003. “Tool Requirements Planning in a Flexible Manufacturing System: Minimizing Tool Costs Subject to a Makespan Constraint.” International Journal of Production Research 41 (14): 3339–3357. doi:10.1080/0020754031000112824
   Web of Science ®Google Scholar
• Koo, P. H., J. M. A. Tanchoco, and J. J. Talavage. 1998. “Estimation of Tool Requirements in Single-Stage Multimachine Systems.” International Journal of Production Research 36 (6): 1699–1713. doi:10.1080/002075498193237
   Web of Science ®Google Scholar
• Koulamas, C. P. 1991. “Total Tool Requirements in Multi-Level Machining Systems.” International Journal of Production Research 29 (2): 417–437. doi:10.1080/00207549108930080
   Web of Science ®Google Scholar
• Lakshminarayanan, B. April, 2008. “High Reliability Miniature RF-MEMS. Switched Capacitors.” Microwave Theory and Techniques IEEE Transactions 56 (4): 971–981. doi: 10.1109/TMTT.2008.919076
   Web of Science ®Google Scholar
• López, H. 2001. “Algoritmo para el dise no óptimo de carros de vulcanizado utilizando programación lineal con un número infinito de variables.” Master's thesis, México: ITESM – Campus Toluca.
   Google Scholar
• Mathirajan, M., V. Chandru, and A. I. Sivakumar. October, 2007. “Heuristic Algorithms for Scheduling Heat-Treatment Furnaces of Steel Casting Industries.” Sādhanā 32 (5): 479–500. doi: 10.1007/s12046-007-0036-4
   Web of Science ®Google Scholar
• Ozdamar, L. 2000. “The Cutting-Wrapping Problem in the Textile Industry: Optimal Overlap of Fabric Lengths and Defects for Maximizing Return Based on Quality.” International Journal of Production Research 38 (6): 1287–1309. doi: 10.1080/002075400188852
   Web of Science ®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. doi: 10.1016/j.ejor.2009.03.042
   Web of Science ®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. doi: 10.1057/palgrave.jors.2601242
   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. doi: 10.1016/0377-2217(90)90357-H
   Web of Science ®Google Scholar
• Toscano, A., S. Rangel, and H. H. Yanasse. August, 2015. “A Heuristic Approach to Minimize the Number of Saw Cycles in Small-Scale Furniture Factories.” Annals of Operations Research 258: 719–746. doi: 10.1007/s10479-015-1955-9
   Web of Science ®Google Scholar
• Trigos, F., and M. López. 2017. “In Search of an Optimal Tooling Capacity for the Vulcanising Planning Decision Problem.” IESM 2017 Conference Proceedings, Saarbrücken, Germany, 376–380.
   Google Scholar
• Trigos, F., and M. López. 2017. “A Vulcanizing Decision Planning as a Particular One-Dimensional Cutting Stock Problem with Limited Part-Related Tooling in Make-to-Order Industrial Environments.” International Journal of Production Research 55 (10): 2881–2896. doi: 10.1080/00207543.2016.1227100
   Web of Science ®Google Scholar
• Tuzun Aksu, D., and B. Durak. 2016. “A Dynamic Programming Algorithm for the Online Cutting Problem with Defects and Quality Grades.” IFAC-PapersOnLine 49 (12): 17–22. doi: 10.1016/j.ifacol.2016.07.543
   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 Logistics39: 369–388. doi: 10.1002/1520-6750(199204)39:3<369::AID-NAV3220390307>3.0.CO;2-F
   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. doi: 10.1016/S0377-2217(02)00124-8
   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. doi: 10.1287/opre.48.6.915.12391
   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. doi: 10.1007/s10479-008-0407-1
   Web of Science ®Google Scholar
• Wang, W., Z. Shi, L. Shi, and Q. Zhao. 2018. “Integrated Optimisation on Flow-Shop Production with Cutting Stock.” International Journal of Production Research doi:10.1080/00207543.2018.1556823
   Google Scholar
• Wayne, B. N. 2004. Accelerated Testing: Statistical Models, Test Plans and Data Analysis. Hoboken, NJ: John Wiley and Sons.
   Google Scholar
• Zavanella, L., and A. Bugini. 1992. “Planning Tool Requirements for Flexible Manufacturing: An Analytical Approach.” International Journal of Production Research 30 (6): 1401–1414. doi:10.1080/00207549208942963
   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–3094. doi: 10.1080/002075497194291
   Web of Science ®Google Scholar
• Zhang, Q., S. Liu, S. Qin, and Y. Shi. 2017. “A Column Generation-based Algorithm for Two-Stage, Two-Dimensional Bin Packing Problem with a Variant Variable Sized Constraint.” 2017 36th Chinese Control Conference (CCC). IEEE, Dalian, China, 2841–2845.
   Google Scholar