Tool switching problems with tool order constraints

DOI10.1016/j.dam.2023.12.031OpenAlexW4391092358MaRDI QIDQ6202949

Marco Locatelli, Alberto Locatelli, Manuel Iori, Juan-José Salazar-González

Publication date: 27 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.12.031

zbMATH Keywords

complexityarc flow modelstool switching problemtool order constraints

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Theory of computing (68Qxx) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Integer linear programming models for the skiving stock problem
• The tool switching problem revisited
• Arrays of distinct representatives --- a very simple NP-complete problem
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• Complexity of a 3-dimensional assignment problem
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• Improved flow-based formulations for the skiving stock problem
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
• Characterization of Totally Unimodular Matrices
• Tool switching problems in the context of overlay printing with multiple colours

This page was built for publication: Tool switching problems with tool order constraints