| List of publications: |
|
|
Citations (Crossref Cited-By Service + Math-Net.Ru) |
|
|
|
 2024 |
| 1. |
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   |
| 2. |
K. A. Lyashkova, V. V. Servakh, “The problem of one machine with equal processing time and preemption”, J. Appl. Industr. Math., 18:3 (2024), 479–488 |
|
| 2021 |
| 3. |
Chernykh, K.A., Servakh, V.V., “Analysis of Optimal Solutions to the Problem of a Single Machine with Preemption”, Communications in Computer and Information Sciencethis link is disabled, 1476, eds. Strekalovsky, A., Kochetov, Y., Gruzdeva, T., Orlov, A., Springer, Cham, 2021 
|
1
[x]
|
|
| 2020 |
| 4. |
S. A. Malakh, V. V. Servakh, “Maximization of unit present profit in inventory management systems”, Autom. Remote Control, 81:5 (2020), 843–852    |
| 5. |
Chernykh K.A., Servakh V.V., “Malotrudoemkii algoritm resheniya zadachi planirovaniya proektov s identichnymi rabotami”, OMSKIE NAUChNYE ChTENIYa - 2020, materialy Chetvertoi Vserossiiskoi nauchnoi konferentsii. (Omsk, 30 noyabrya-05 dekabrya 2020 g.), OmGU, 2020, 2138-2142 (to appear) |
|
| 2019 |
| 6. |
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 |
|
| 2018 |
| 7. |
Chernykh, K.A., Servakh, V.V., “The planning investment project with identical independent jobs”, 2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL, CEUR Workshop Proceedings (Omsk; Russian Federation; 8 July 2018 do 14 July 2018), CEUR-WS, 2018, 82-93 |
|
| 2017 |
| 8. |
E. A. Bobrova, V. V. Servakh, “Construction of cyclic schedules in presence of parallel machines”, J. Appl. Industr. Math., 11:1 (2017), 17–25 |
| 9. |
V. V. Servakh, S. A. Malakh, “Minimizing total payments and default risk of borrower in mortgage”, Autom. Remote Control, 78:12 (2017), 2222–2231 |
|
| 2015 |
| 10. |
E. A. Kazakovtseva, V. V. Servakh, “The complexity of the project scheduling problem with credits”, J. Appl. Industr. Math., 9:4 (2015), 489–496 |
|
| 2014 |
| 11. |
E. A. Kazakovtseva, V. V. Servakh, “Financing and reliability analysis for schedules in the project calendar planning problem”, Autom. Remote Control, 75:7 (2014), 1231–1240 |
|
| 2015 |
| 12. |
N. I. Burlakova, V. V. Servakh, “An Algorithm of Logistic Costs Minimization Under Constraints on Supply Volumes”, J. Math. Sci., 211:6 (2015), 752–759 |
|
| 2013 |
| 13. |
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 |
|
| 2012 |
| 14. |
E. A. Martynova, V. V. Servakh, “On scheduling credited projects”, Autom. Remote Control, 73:3 (2012), 508–516 |
| 15. |
Martynova EA; Servakh VV, “On scheduling credited projects”, AUTOMATION AND REMOTE CONTROL, 73:3 (2012), 508-516 
|
6
[x]
|
|
| 2009 |
| 16. |
A. A. Romanova, V. V. Servakh, “Optimization of identical jobs production on the base of cyclic schedules”, J. Appl. Industr. Math., 3:4 (2009), 496–504 |
|
| 2008 |
| 17. |
Servakh Vladimir V.; Shcherbinina Tatyana A., “Complexity of Project Scheduling Problem with Nonrenewable Resources”, Annual International Conference of the German-Operations-Research-, Editor(s): Kalcsics J; Nickel Sponsor(s): German Operat Res Soc (Society Location: Saarbrucken, GERMANY Date: SEP 05-07, 2007), 2008, 2008, 427-431 |
| 18. |
Servakh, Vladimir V.; Shcherbinina, Tatyana A., “Complexity of project scheduling problem with nonrenewable resources. (English)”, Operations Research Proceedings 2007. Selected papers of the annual international conference of the German Operations Research Society (GOR), (Saarbrücken, Germany, September 5–7, 2007.), MSC2000: *90B35 90B70, Springer, Berlin, 2008, 427-431 |
| 19. |
V. V. Servakh, T. A. Shcherbinina, “Complexity of some project scheduling problem with nonrenewable resources”, Vestnik, Quart. J. of Novosibirsk State Univ., Series: Math., mech. and informatics, 8:3 (2008), 105–112 |
| 20. |
V. V. Servakh, “A polynomially solvable case of the three-stage Johnson problem”, J. Appl. Industr. Math., 2:3 (2008), 397–405 |
|
| 2007 |
| 21. |
A. V. Eremeev, A. A. Romanova, V. V. Servakh, S. S. Chauhan, “Approximation solution of the supply management problem”, J. Appl. Industr. Math., 1:4 (2007), 433–441 |
|
| 2005 |
| 22. |
Chauhan SS; Eremeev AV; Romanova AA; Servakh V.V., “Approximation of the supply scheduling problem”, OPERATIONS RESEARCH LETTERS, 33:3 (2005), 249-254 , DOI: 10.1016/j.orl.2004.04.015
|
22
[x]
|
| 23. |
Chauhan Satyaveer Singh; Eremeev Anton; Kolokolov Alexander; Servakh V.V., “CONCAVE COST SUPPLY MANAGEMENT FOR SINGLE MANUFACTURING UNIT Book Author(s): Zaikin, O Source: SUPPLY CHAIN OPTIMISATION: PRODUCT/PROCESS DESIGN, FACILITY LOCATION AND FLOW CONTROL Book Series: Applied Optimization Volume: 94 Pages: 167-174 Published: 2005”, Editor(s): Dolgui A; Soldek J, SUPPLY CHAIN OPTIMISATION: PRODUCT/PROCESS DESIGN, FACILITY LOCATION AND FLOW CONTROL, Book Series: Applied Optimization, 94, Published, 2005, 167-174
|
8
[x]
|
|
| 2004 |
| 24. |
V. V. Servakh, S. L. Sukhikh, “Hybrid algorithm for scheduling with regard for reinvestment of profits”, Autom. Remote Control, 65:3 (2004), 449–455 |
|
| 2000 |
| 25. |
V. V. Servakh, “An efficiently solvable case of the scheduling problem with renewable resources”, Diskretn. Anal. Issled. Oper., 7:1 (2000), 75–82 |
|
| 1988 |
| 26. |
V. V. Servakh, “The traveling salesman problem on tape graphs”, Upravliaemie systemy, 1988, no. 28, 45–55 |
|
| 1983 |
| 27. |
V. V. Servakh, “The Akers–Friedman problem”, Upravliaemie systemy, 1983, no. 23, 70–81 |
|
Contact us: