Tool switching problems with tool order constraints

DOI10.1016/J.DAM.2023.12.031OpenAlexW4391092358MaRDI QIDQ6202949FDOQ6202949

Authors: Manuel Iori, Alberto Locatelli, Marco Locatelli, 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

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

Cites Work

• Title not available (Why is that?)
• Arrays of distinct representatives --- a very simple NP-complete problem
• Complexity of a 3-dimensional assignment problem
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• The tool switching problem revisited
• Integer linear programming models for the skiving stock problem
• Characterization of Totally Unimodular Matrices
• Improved flow-based formulations for the skiving stock problem
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
• 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
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202949)