Improved heuristic algorithms for the job sequencing and tool switching problem
type: Item
instance of: scholarly article
title: Improved heuristic algorithms for the job sequencing and tool switching problem
zbMATH Open document ID: 1391.90228
author: Gustavo Silva Paiva
author: Marco Antonio M. Carvalho
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 62G10
zbMATH DE Number: 6902770
zbMATH Keywords: scheduling
zbMATH Keywords: job sequencing and tool switching problem
zbMATH Keywords: iterated local search
describes a project that uses: irace
MaRDI profile type: Publication
full work available at URL: j.cor.2017.07.013
OpenAlex ID: W2738101055
cites work: Minimizing the number of switch instances on a flexible machine in polynomial time
cites work: Tool magazine arrangement and operations sequencing on CNC machines
cites work: Scheduling identical parallel machines with tooling constraints
cites work: Scheduling multi-colour print jobs with sequence-dependent setup times
cites work: Improved integer linear programming formulations for the job sequencing and tool switching problem
cites work: Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
cites work: Combinatorial optimization models for production scheduling in automated manufacturing systems
cites work: The tool switching problem revisited
cites work: Minimization of the Number of Tool Magazine Setups on Automated Machines: A Lagrangean Decomposition Approach
cites work: Heuristic procedures for the parallel machine problem with tool switches
cites work: An algorithmic framework for tool switching problems with multiple objectives
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem
cites work: An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
cites work: Q4452900
cites work: The online tool switching problem with non-uniform tool size
cites work: A strongly competitive randomized paging algorithm
cites work: \(k\)-server problems with bulk requests: an application to tool switching in manufacturing
cites work: The modular tool switching problem
cites work: An analysis of variance test for normality (complete samples)
cites work: Optimal tooling policy for a tool switching problem of a flexible machine with automatic tool transporter
cites work: Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
DOI: 10.1016/J.COR.2017.07.013
description: scientific article; zbMATH DE number 6902770