Improved heuristic algorithms for the job sequencing and tool switching problem

DOI10.1016/j.cor.2017.07.013zbMath1391.90228OpenAlexW2738101055MaRDI QIDQ1651541

Gustavo Silva Paiva, Marco Antonio M. Carvalho

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.07.013

zbMATH Keywords

schedulingiterated local searchjob sequencing and tool switching problem

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)

Related Items

Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ Heuristic methods to consecutive block minimization ⋮ Iterated local search for consecutive block minimization ⋮ Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times ⋮ Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints ⋮ Unsupervised parallel machines scheduling with tool switches ⋮ Exponential neighborhood search for consecutive block minimization ⋮ Minimizing the makespan on two identical parallel machines with mold constraints ⋮ An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ A matheuristic for parallel machine scheduling with tool replacements

Uses Software

• irace

Cites Work

• Unnamed Item
• Improved integer linear programming formulations for the job sequencing and tool switching problem
• Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
• The modular tool switching problem
• A strongly competitive randomized paging algorithm
• The tool switching problem revisited
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• \(k\)-server problems with bulk requests: an application to tool switching in manufacturing
• An algorithmic framework for tool switching problems with multiple objectives
• Scheduling identical parallel machines with tooling constraints
• Minimizing the number of switch instances on a flexible machine in polynomial time
• An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
• Scheduling multi-colour print jobs with sequence-dependent setup times
• Tool magazine arrangement and operations sequencing on CNC machines
• Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem
• Minimization of the Number of Tool Magazine Setups on Automated Machines: A Lagrangean Decomposition Approach
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• The online tool switching problem with non-uniform tool size
• Heuristic procedures for the parallel machine problem with tool switches
• Optimal tooling policy for a tool switching problem of a flexible machine with automatic tool transporter
• An analysis of variance test for normality (complete samples)