Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
DOI10.1016/J.COR.2015.10.009zbMATH Open1349.90326DBLPjournals/cor/ChavesLSR16OpenAlexW2194264221WikidataQ58524957 ScholiaQ58524957MaRDI QIDQ342275FDOQ342275
Authors: Mauricio G. C. Resende, E. L. F. Senne, A. A. Chaves, Luiz Antonio Nogueira Lorena 
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11449/158648
Recommendations
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem
- scientific article; zbMATH DE number 710070
- Improved heuristic algorithms for the job sequencing and tool switching problem
- An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines
- Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A biased random-key genetic algorithm for road congestion minimization
- Fundamentals of scatter search and path relinking
- Variable Neighborhood Search
- TTT plots: a perl program to create time-to-target plots
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- A hybrid biased random key genetic algorithm approach for the unit commitment problem
- Hybrid cooperation models for the tool switching 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
Cited In (14)
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
- Exploiting symmetry for the job sequencing and tool switching problem
- The dial-a-ride problem with private fleet and common carrier
- A biased random‐key genetic algorithm for the home health care problem
- A matheuristic for parallel machine scheduling with tool replacements
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem
- Unsupervised parallel machines scheduling with tool switches
- Order picking along a crane-supplied pick face: the SKU switching problem
- Scheduling identical parallel machines with tooling constraints
- Improved heuristic algorithms for the job sequencing and tool switching problem
- An algorithmic framework for tool switching problems with multiple objectives
- A random-key GRASP for combinatorial optimization
- Hybrid cooperation models for the tool switching problem
Uses Software
This page was built for publication: Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342275)
