scientific article; zbMATH DE number 7406268

zbMath1471.90157MaRDI QIDQ5154491

Yailen Martínez Jiménez, Yunior César Fonseca Reyna, Ann Nowé

Publication date: 5 October 2021

Full work available at URL: http://archives-web.univ-paris1.fr/rev-inv-ope/fileadmin/rev-inv-ope/files/38317/38317-09.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimizationschedulingmakespanQ-learningflow-shop

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed
• Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
• Minimizing makespan for a no-wait flowshop using genetic algorithm
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• A multi-objective particle swarm for a flow shop scheduling problem
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
• A genetic algorithm for flowshop sequencing
• Asynchronous stochastic approximation and Q-learning
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
• A bicriteria approach to the two-machine flow shop scheduling problem
• \({\mathcal Q}\)-learning
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• Benchmarks for basic scheduling problems
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
• Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
• The Complexity of Flowshop and Jobshop Scheduling
• Comparison of distributed methods for resource allocation
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
• Scheduling
• Two-machine flow shops with limited machine availability