Tool switching problems with tool order constraints
From MaRDI portal
Publication:6202949
Recommendations
- Tool switching problems in the context of overlay printing with multiple colours
- The tool switching problem revisited
- The modular tool switching problem
- An algorithmic framework for tool switching problems with multiple objectives
- Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Arrays of distinct representatives --- a very simple NP-complete problem
- Characterization of Totally Unimodular Matrices
- Complexity of a 3-dimensional assignment problem
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Improved flow-based formulations for the skiving stock problem
- Integer linear programming models for the skiving stock problem
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- The tool switching problem revisited
- 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)