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

DOI10.1016/J.ORL.2015.04.001zbMATH Open1408.90119OpenAlexW2077245622MaRDI QIDQ1785367FDOQ1785367

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

Recommendations

• Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
• scientific article; zbMATH DE number 710070
• Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• Minimizing total flow time on a single flexible machine

zbMATH Keywords

schedulingcombinatorial algorithmmanufacturingtool switchingflexible machine

Mathematics Subject Classification ID

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

Cites Work

• Optimization, approximation, and complexity classes
• Hamilton Paths in Grid Graphs
• Production planning problems in printed circuit board assembly
• Scheduling with few changes
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• The tool switching problem revisited
• Optimal tooling policy for a tool switching problem of a flexible machine with automatic tool transporter
• Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
• A column generation approach to job grouping for flexible manufacturing systems

Cited In (8)

• Title not available (Why is that?)
• Exploiting symmetry for the job sequencing and tool switching problem
• A simple and effective hybrid genetic search for the job sequencing and tool switching problem
• Optimal tooling policy for a tool switching problem of a flexible machine with automatic tool transporter
• The tool switching problem revisited
• Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
• Improved heuristic algorithms for the job sequencing and tool switching problem
• An algorithmic framework for tool switching problems with multiple objectives

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

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