Natalja M. Matsveichuk

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

Collaborative distances:

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

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