Biased random-key genetic algorithms: A review
This paper is a comprehensive literature review of Biased Random-Key Genetic Algorithms
(BRKGA). BRKGA is a metaheuristic that employs random-key-based chromosomes with …
(BRKGA). BRKGA is a metaheuristic that employs random-key-based chromosomes with …
The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends
D Calmels - International Journal of Production Research, 2019 - Taylor & Francis
The job sequencing and tool switching problem is a combinatorial optimisation problem that
appears in various industries, mainly in the manufacturing sector. Although tool switching is …
appears in various industries, mainly in the manufacturing sector. Although tool switching is …
A genetic algorithm based on dual hesitant fuzzy preference relations for consensus group decision making
Consensus is an important issue in group decision making as it aims to avoid future
contestation by the decision makers. The elicitation of criteria and decision makers' weights …
contestation by the decision makers. The elicitation of criteria and decision makers' weights …
[HTML][HTML] A matheuristic for parallel machine scheduling with tool replacements
This paper addresses the problem of scheduling a set of jobs with tool requirements on
identical parallel machines in a work center. This problem considers the following …
identical parallel machines in a work center. This problem considers the following …
Scheduling identical parallel machines with tooling constraints
We model and solve the problem of sequencing a set of jobs with specified processing times
and tool requirements on a set of identical parallel machines. Decisions concern the …
and tool requirements on a set of identical parallel machines. Decisions concern the …
A hybrid matheuristic for the two-stage capacitated facility location problem
In the class of supply chain problems, the Two-Stage Capacitated Facility Location (TSCFL)
is defined by optimal locations for installing factories and warehouses to meet the demand of …
is defined by optimal locations for installing factories and warehouses to meet the demand of …
[HTML][HTML] Improved heuristic algorithms for the job sequencing and tool switching problem
GS Paiva, MAM Carvalho - Computers & Operations Research, 2017 - Elsevier
In flexible manufacturing systems, a single machine can be configured with different tools for
processing different jobs, each requiring a specific set of tools. There is a limit to the …
processing different jobs, each requiring a specific set of tools. There is a limit to the …
Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem
This paper proposes an adaptive Biased Random-key Genetic Algorithm (A-BRKGA), a new
method with on-line parameter control for combinatorial optimization problems. A-BRKGA …
method with on-line parameter control for combinatorial optimization problems. A-BRKGA …
A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem
One of the well-known problems in single machine scheduling context is the Job
Sequencing and Tool Switching Problem (SSP). The SSP is optimally sequencing a finite set …
Sequencing and Tool Switching Problem (SSP). The SSP is optimally sequencing a finite set …
A biased random-key genetic algorithm for the maximum quasi-clique problem
Given a graph G=(V, E) and a threshold γ∈(0, 1], the maximum cardinality quasi-clique
problem consists in finding a maximum cardinality subset C* of the vertices in V such that the …
problem consists in finding a maximum cardinality subset C* of the vertices in V such that the …