Natalja M. Matsveichuk

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

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

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

Quan Zhong, Yang Yu, Zixiang Li, Liangliang Sun, Yuyan Han, Natalja M. Matsveichuk, Yuri N. Sotskov

Expert Syst. Appl., 2026

2025

Differential evolution based on individual information parameter setting and diversity measurement of aggregated distribution.

Zhenghao Song, Liangliang Sun, Natalja M. Matsveichuk, Yuri N. Sotskov, Shenglong Jiang, Yang Yu

Swarm Evol. Comput., 2025

Diversity enhancement-based Differential Evolution with a novel perturbation strategy.

Zhenghao Song, Liangliang Sun, Natalja M. Matsveichuk, Yuri N. Sotskov

Swarm Evol. Comput., 2025

Hierarchically controlled differential evolution algorithm.

Liangliang Sun, Zhenghao Song, Jing Liu, Haipeng Ji, Ge Guo, Natalja M. Matsveichuk, Yuri N. Sotskov

Expert Syst. Appl., 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.

Liangliang Sun, Xirang Hao, Yunpeng Li, Jinghan Xue, Natalja M. Matsveichuk, Yuri N. Sotskov, Qichun Zhang

Complex Syst. Model. Simul., 2024

2020

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

Yuri N. Sotskov, Natalja M. Matsveichuk, Vadzim D. Hatsura

Algorithms, 2020

2009

Schedule execution for two-machine flow-shop with interval processing times.

Natalja M. Matsveichuk, Yuri N. Sotskov, Natalja G. Egorova, Tsung-Chyan Lai

Math. Comput. Model., 2009

Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times.

C. T. Ng, Natalja M. Matsveichuk, Yuri N. Sotskov, T. C. Edwin Cheng

Asia Pac. J. Oper. Res., 2009