An algorithmic framework for tool switching problems with multiple objectives

DOI10.1016/J.EJOR.2016.11.034MaRDI QIDQ1751917zbMATH OpenOpenAlexFDO

Authors Martina Furrer, Torsten Mütze

Publication date 25 May 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2016.11.034

zbMATH Keywords

branch-and-boundflexible manufacturing systemtool switching

Mathematics Subject Classification ID

Production models (90B30) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• The tool switching problem revisited
• The modular tool switching problem
• Heuristic procedures for the parallel machine problem with tool switches
• Improved heuristic algorithms for the job sequencing and tool switching problem
• The online tool switching problem with non-uniform tool size
• Hybrid cooperation models for the tool switching problem
• Hybrid method with CS and BRKGA applied to the minimization of tool switches problem

Cites work

• k-server problems with bulk requests: an application to tool switching in manufacturing
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
• Improved integer linear programming formulations for the job sequencing and tool switching problem
• Minimizing the number of switch instances on a flexible machine in polynomial time
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
• Optimal tooling policy for a tool switching problem of a flexible machine with automatic tool transporter
• Scheduling with few changes
• Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
• Totally-Balanced and Greedy Matrices
• Worst-case performance of approximation algorithms for tool management problems

Cited in

(13)

• Improved heuristic algorithms for the job sequencing and tool switching problem
• A simple and effective hybrid genetic search for the job sequencing and tool switching problem
• A matheuristic for parallel machine scheduling with tool replacements
• Improved integer linear programming formulations for the job sequencing and tool switching problem
• Hybrid cooperation models for the tool switching problem
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• The online tool switching problem with non-uniform tool size
• Optimal tooling policy for a tool switching problem of a flexible machine with automatic tool transporter
• Unsupervised parallel machines scheduling with tool switches
• Tool switching problems in the context of overlay printing with multiple colours
• Tool switching problems with tool order constraints
• Exploiting symmetry for the job sequencing and tool switching problem
• Minimizing total flow time on a single flexible machine

This page was built for publication: An algorithmic framework for tool switching problems with multiple objectives

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