A Computational Study of the Tool Replacement Problem

Published Online:https://doi.org/10.1287/ijoc.2023.0474

References

  • Abrham S, Geremew S (2019) Application of lean tools for reduction of manufacturing lead time. Zimale F, Enku Nigussie T, Fanta S, eds. Adv. Sci. Tech. 6th EAI Internat. Conf. ICAST 2018 (Springer, Cham, Switzerland), 1–10.Google Scholar
  • Adjiashvili D, Bosio S, Zemmer K (2015) Minimizing the number of switch instances on a flexible machine in polynomial time. Oper. Res. Lett. 43(3):317–322.CrossrefGoogle Scholar
  • Ahmadi E, Goldengorin B, Süer GA, Mosadegh H (2018) A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem. Appl. Soft Comput. 65:214–229.CrossrefGoogle Scholar
  • Alad AH, Deshpande VA (2014) A review of various tools and techniques for lead time reduction. Internat. J. Engrg. Development Res. 2(1):1159–1164.Google Scholar
  • Beezão AC, Cordeau JF, Laporte G, Yanasse HH (2017) Scheduling identical parallel machines with tooling constraints. Eur. J. Oper. Res. 257(3):834–844.CrossrefGoogle Scholar
  • Belady LA (1966) A study of replacement algorithms for a virtual-storage computer. IBM Systems J. 5(2):78–101.CrossrefGoogle Scholar
  • Calmels D (2019) The job sequencing and tool switching problem: State-of-the-art literature review, classification, and trends. Internat. J. Production Res. 57(15–16):5005–5025.CrossrefGoogle Scholar
  • Catanzaro D, Gouveia L, Labbé M (2015) Improved integer linear programming formulations for the job sequencing and tool switching problem. Eur. J. Oper. Res. 244(3):766–777.CrossrefGoogle Scholar
  • Crama Y, Kolen AWJ, Oerlemans AG, Spieksma FCR (1994) Minimizing the number of tool switches on a flexible machine. Internat. J. Flexible Manufacturing Systems 6(1):33–54.CrossrefGoogle Scholar
  • Crama Y, Moonen LS, Spieksma FC, Talloen E (2007) The tool switching problem revisited. Eur. J. Oper. Res. 182(2):952–957.CrossrefGoogle Scholar
  • Crowder H, Johnson EL, Padberg M (1983) Solving large-scale zero-one linear programming problems. Oper. Res. 31(5):803–834.LinkGoogle Scholar
  • Cura T (2023) Hybridizing local searching with genetic algorithms for the job sequencing and tool switching problem with non-identical parallel machines. Expert Systems Appl. 223:119908.CrossrefGoogle Scholar
  • da Silva TT, Chaves AA, Yanasse HH (2021) A new multicommodity flow model for the job sequencing and tool switching problem. Internat. J. Production Res. 59(12):3617–3632.CrossrefGoogle Scholar
  • Dang QV, van Diessen T, Martagan T, Adan I (2021) A matheuristic for parallel machine scheduling with tool replacements. Eur. J. Oper. Res. 291(2):640–660.CrossrefGoogle Scholar
  • Dang QV, Herps K, Martagan T, Adan I, Heinrich J (2023) Unsupervised parallel machines scheduling with tool switches. Comput. Oper. Res. 160:106361.CrossrefGoogle Scholar
  • Daskin M, Jones PC, Lowe TJ (1990) Rationalizing tool selection in a flexible manufacturing system for sheet-metal products. Oper. Res. 38(6):1104–1115.LinkGoogle Scholar
  • Fomin A, Goldengorin B (2022) An exact algorithm for the preemptive single machine scheduling of equal-length jobs. Comput. Oper. Res. 142:105742.CrossrefGoogle Scholar
  • Gayman D (1986) Computers in the tool crib. Manufacturing Engrg. 97(3):41–44.Google Scholar
  • Ghiani G, Grieco A, Guerriero E (2010) Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem. Networks 55(4):379–385.CrossrefGoogle Scholar
  • Gray AE, Seidmann A, Stecke KE (1993) A synthesis of decision models for tool management in automated manufacturing. Management Sci. 39(5):549–567.LinkGoogle Scholar
  • Johnson DS (2002) A theoretician’s guide to the experimental analysis of algorithms. Goldwasser MH, Johnson DS, McGeoch CC, eds. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges: Papers Related to the DIMACS Challenge on Dictionaries and Priority Queues (1995–1996) and the DIMACS Challenge on Near Neighbor Searches (1998–1999). DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 59 (American Mathematical Society, Providence, RI), 215–250.Google Scholar
  • Kumar N, Singh G, Trehan R, Davim JP, eds. (2023) Advances in Materials and Agile Manufacturing. Select Proceedings of CPIE 2023 (Springer, Singapore).Google Scholar
  • Lin CJ, Pearn WL (2011) Efficient tool replacement procedure based on yield evaluation. J. Testing Evaluation 39(3):474–480.CrossrefGoogle Scholar
  • Manvi S, Shyam G (2021) Cloud Computing: Concepts and Technologies (CRC Press, Boca Raton, FL).CrossrefGoogle Scholar
  • Mecler J, Subramanian A, Vidal T (2021) A simple and effective hybrid genetic search for the job sequencing and tool switching problem. Comput. Oper. Res. 127:105153.CrossrefGoogle Scholar
  • Paiva GS, Carvalho MAM (2017) Improved heuristic algorithms for the job sequencing and tool switching problem. Comput. Oper. Res. 88:208–219.CrossrefGoogle Scholar
  • Pearn WL, Hsu YC, Horng Shiau JJ (2007) Tool replacement policy for one-sided processes with low fraction defective. J. Oper. Res. Soc. 58(8):1075–1083.CrossrefGoogle Scholar
  • Qiu Y, Cherniavskii M, Goldengorin B, Pardalos PM (2025) A computational study of the tool replacement problem. http://dx.doi.org/10.1287/ijoc.2023.0474.cd, https://github.com/INFORMSJoC/2023.0474.Google Scholar
  • Raduly-Baka C, Nevalainen OS (2015) The modular tool switching problem. Eur. J. Oper. Res. 242(1):100–106.CrossrefGoogle Scholar
  • Reddy CE, Chetty OVK, Chaudhuri D (1992) A Petri net based approach for analysing tool management issues in FMS. Internat. J. Production Res. 30(6):1427–1446.CrossrefGoogle Scholar
  • Rifai AP, Sutoyo E, Mara STW, Dawal SZM (2023) Multiobjective sequence-dependent job sequencing and tool switching problem. IEEE Systems J. 17(1):1395–1406.CrossrefGoogle Scholar
  • Rosa LM, Feiring BR (1995) Layout problem for an aircraft maintenance company tool room. Internat. J. Production Econom. 40(2–3):219–230.CrossrefGoogle Scholar
  • San Segundo P, Rodríguez-Losada D, Jiménez A (2011) An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2):571–581.CrossrefGoogle Scholar
  • Singamneni S, Yifan L, Hewitt A, Chalk R, Thomas W, Jordison D (2019) Additive manufacturing for the aircraft industry: A review. J. Aeronautics Aerospace Engrg. 8(1):351–371.Google Scholar
  • Tang CS, Denardo EV (1988a) Models arising from a flexible manufacturing machine, part I: Minimization of the number of tool switches. Oper. Res. 36(5):767–777.LinkGoogle Scholar
  • Tang CS, Denardo EV (1988b) Models arising from a flexible manufacturing machine, part II: Minimization of the number of switching instants. Oper. Res. 36(5):778–784.LinkGoogle Scholar
  • Tomek P (1986) Tooling concepts for FMS. Rathmill K, ed. Proc. 5th Internat. Conf. Flexible Manufacturing Systems (Springer, Berlin), 315–325.Google Scholar
  • Van Hop N, Nagarur NN (2004) The scheduling problem of PCBs for multiple non-identical parallel machines. Eur. J. Oper. Res. 158(3):577–594.CrossrefGoogle Scholar
  • Yadav A, Jayswal S (2018) Modelling of flexible manufacturing system: A review. Internat. J. Production Res. 56(7):2464–2487.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.