Minimizing the number of switch instances on a flexible machine in polynomial time

DOI10.1016/j.orl.2015.04.001zbMath1408.90119OpenAlexW2077245622MaRDI QIDQ1785367

David Adjiashvili, Kevin Zemmer, Sandro Bosio

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.04.001

zbMATH Keywords

manufacturingschedulingcombinatorial algorithmtool switchingflexible machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (3)

Improved heuristic algorithms for the job sequencing and tool switching problem ⋮ An algorithmic framework for tool switching problems with multiple objectives ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem

Cites Work

• Scheduling with few changes
• Production planning problems in printed circuit board assembly
• The tool switching problem revisited
• Optimization, approximation, and complexity classes
• A column generation approach to job grouping for flexible manufacturing systems
• 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
• Hamilton Paths in Grid Graphs

This page was built for publication: Minimizing the number of switch instances on a flexible machine in polynomial time