Natalja M. Matsveichuk

Orcid: 0000-0001-8010-9759

According to our database1, Natalja M. Matsveichuk authored at least 15 papers between 2009 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Differential evolution with a variance contribution ratio-based diversity enhancement mechanism for numerical optimization.
Swarm Evol. Comput., 2026

Discrete artificial bee colony algorithm based on multiple neighborhood swaps for the hybrid flowshop scheduling problem with uncertain processing stages.
Swarm Evol. Comput., 2026

An adaptive differential evolution with deeply informed mutation strategy and historical information for numerical optimization.
Inf. Sci., 2026

An iterative greedy algorithm based on neighborhood search for energy-efficient scheduling of distributed permutation flowshop with sequence-dependent setup time.
Expert Syst. Appl., 2026

A hybrid differential evolution with discrete cosine transform-based mutation strategy and dynamic diversity mechanism.
Expert Syst. Appl., 2026

Cooperative co-evolution based differential evolutional algorithm.
Expert Syst. Appl., 2026

2025
Differential evolution with bi-strategy co-deployment framework and diversity improvement.
Swarm Evol. Comput., 2025

Differential evolution based on individual information parameter setting and diversity measurement of aggregated distribution.
Swarm Evol. Comput., 2025

Diversity enhancement-based Differential Evolution with a novel perturbation strategy.
Swarm Evol. Comput., 2025

Hierarchically controlled differential evolution algorithm.
Expert Syst. Appl., 2025

A review of dynamic flexible regulation strategies for multi-energy coupled steelmaking-continuous casting production.
Eng. Appl. Artif. Intell., 2025

2024
A Review of Integrated Optimization Method of Batch Planning and Scheduling for Steelmaking-Continuous Casting-Hot Rolling Production Under Uncertain Environment Based on Lagrangian Relaxation Framework.
Complex Syst. Model. Simul., 2024

2020
Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations.
Algorithms, 2020

2009
Schedule execution for two-machine flow-shop with interval processing times.
Math. Comput. Model., 2009

Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times.
Asia Pac. J. Oper. Res., 2009


  Loading...