No label defined (Q5154491)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7406268

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7406268

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

Yunior César Fonseca Reyna

0 references

Yailen Martínez Jiménez

0 references

0 references

publication date

5 October 2021

0 references

full work available at URL

http://archives-web.univ-paris1.fr/rev-inv-ope/fileadmin/rev-inv-ope/files/38317/38317-09.pdf

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

flow-shop

0 references

makespan

0 references

optimization

0 references

scheduling

0 references

Q-learning

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach

0 references

0 references

Minimizing makespan for a no-wait flowshop using genetic algorithm

0 references

Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation

0 references

The Complexity of Flowshop and Jobshop Scheduling

0 references

Two-machine flow shops with limited machine availability

0 references

Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

0 references

An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

0 references

0 references

A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem

0 references

0 references

A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

0 references

A multi-objective particle swarm for a flow shop scheduling problem

0 references

Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.

0 references

A genetic algorithm for flowshop sequencing

0 references

An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times

0 references

Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance

0 references

A bicriteria approach to the two-machine flow shop scheduling problem

0 references

Benchmarks for basic scheduling problems

0 references

A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem

0 references

An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed

0 references

Asynchronous stochastic approximation and Q-learning

0 references

A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs

0 references

\({\mathcal Q}\)-learning

0 references

Comparison of distributed methods for resource allocation

0 references

Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5154491

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5154491&oldid=36720048"