A simple and effective hybrid genetic search for the job sequencing and tool switching problem
From MaRDI portal
Publication:2027021
DOI10.1016/j.cor.2020.105153OpenAlexW3099114606MaRDI QIDQ2027021
Anand Subramanian, Thibaut Vidal, Jordana Mecler
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.10021
Related Items (2)
Unsupervised parallel machines scheduling with tool switches ⋮ Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
Cites Work
- Scheduling with few changes
- Improved integer linear programming formulations for the job sequencing and tool switching problem
- Hybrid metaheuristics for the clustered vehicle routing problem
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
- The modular tool switching problem
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- Improved heuristic algorithms for the job sequencing and tool switching problem
- Heuristics for vehicle routing problems: sequence or set optimization?
- 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
- On the \(k\)-coloring of intervals
- 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
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A unified solution framework for multi-attribute vehicle routing problems
- Tool magazine arrangement and operations sequencing on CNC machines
- Interval scheduling on identical machines
- Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle 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
- Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- The online tool switching problem with non-uniform tool size
- Worst-case performance of approximation algorithms for tool management problems
- Heuristic procedures for the parallel machine problem with tool switches
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
This page was built for publication: A simple and effective hybrid genetic search for the job sequencing and tool switching problem
