Chauhan S. S., Eremeev A. V., Romanova A. A., Servakh V. V., Woeginger G. J., “Approximation of the supply scheduling problem”, Operations Research Letters, 33:3 (2005), 249–254
A. A. Romanova, V. V. Servakh, V. Yu. Tavchenko, “Makespan minimization in reentrant flow shop problem with identical jobs”, Prikl. Diskr. Mat., 2024, no. 64, 99–111
2019
2.
A. A. Romanova, V. V. Servakh, “Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints”, Diskretn. Anal. Issled. Oper., 26:4 (2019), 56–73
2015
3.
A. A. Romanova, “Effective algorithms for one scheduling problem on two machines with makespan minimization”, Diskretn. Anal. Issled. Oper., 22:4 (2015), 63–79; J. Appl. Industr. Math., 9:4 (2015), 570–579
E. A. Bobrova, A. A. Romanova, V. V. Servakh, “The complexity of cyclic scheduling for identical jobs”, Diskretn. Anal. Issled. Oper., 20:4 (2013), 3–14
A. A. Romanova, V. V. Servakh, “Optimization of identical jobs production on the base of cyclic schedules”, Diskretn. Anal. Issled. Oper., 15:5 (2008), 47–60; J. Appl. Industr. Math., 3:4 (2009), 496–504
A. V. Eremeev, A. A. Romanova, V. V. Servakh, S. S. Chauhan, “Approximation solution of the supply management problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 13:1 (2006), 27–39; J. Appl. Industr. Math., 1:4 (2007), 433–441
Contact us: