Hybrid method with CS and BRKGA applied to the minimization of tool switches problem

DOI10.1016/J.COR.2015.10.009MaRDI QIDQ342275zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

genetic algorithmschedulinghybrid heuristicsclustering searchtool switches

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A biased random-key genetic algorithm for road congestion minimization
• A hybrid biased random key genetic algorithm approach for the unit commitment problem
• Fundamentals of scatter search and path relinking
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Heuristic procedures for the parallel machine problem with tool switches
• Hybrid cooperation models for the tool switching problem
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• Optimal tooling policy for a tool switching problem of a flexible machine with automatic tool transporter
• TTT plots: a perl program to create time-to-target plots
• The online tool switching problem with non-uniform tool size
• Variable Neighborhood Search

Cited in

(14)

• A biased random‐key genetic algorithm for the home health care problem
• A biased random-key genetic algorithm for the maximum quasi-clique problem
• An algorithmic framework for tool switching problems with multiple objectives
• The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
• 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
• A simple and effective hybrid genetic search for the job sequencing and tool switching problem
• Improved heuristic algorithms for the job sequencing and tool switching problem
• The dial-a-ride problem with private fleet and common carrier
• A matheuristic for parallel machine scheduling with tool replacements
• Hybrid cooperation models for the tool switching problem
• Exploiting symmetry for the job sequencing and tool switching problem
• A random-key GRASP for combinatorial optimization

Describes a project that uses

Uses Software

• PERL
• Scatter Search
• TTTPLOTS
• irace

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)