Tool switching problems in the context of overlay printing with multiple colours

DOI10.1007/978-3-031-18530-4_19zbMath1528.90219OpenAlexW4312631992MaRDI QIDQ6111513

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

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-18530-4_19

zbMATH Keywords

complexityarc flow modelsoverlay printingtool switching problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

Tool switching problems with tool order constraints

Cites Work

• Unnamed Item
• The traveling salesman problem: An overview of exact and approximate algorithms
• Arrays of distinct representatives --- a very simple NP-complete problem
• Complexity of a 3-dimensional assignment problem
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches

This page was built for publication: Tool switching problems in the context of overlay printing with multiple colours