default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Kovalev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Sergey Kovalev, Isabelle Chalamon, Audrey Bécuwe:
Single machine scheduling with resource constraints: Equivalence to two-machine flow-shop scheduling for regular objectives. J. Oper. Res. Soc. 75(7): 1343-1346 (2024)- 2023
- [j21]Evgeny Gurevsky, Dmitry Kopelevich, Sergey Kovalev, Mikhail Y. Kovalyov:
Integer knapsack problems with profit functions of the same value range. 4OR 21(3): 405-419 (2023) - [j20]Sergey Kovalev
, Isabelle Chalamon, Fabio J. Petani:
Maximizing single attribute diversity in group selection. Ann. Oper. Res. 320(1): 535-540 (2023) - [j19]Jan-Erik Justkowiak, Sergey Kovalev, Mikhail Y. Kovalyov, Erwin Pesch:
Single machine scheduling with assignable due dates to minimize maximum and total late work. Eur. J. Oper. Res. 308(1): 76-83 (2023) - 2022
- [j18]Sergey Kovalev:
Approximation issues of fractional knapsack with penalties: a note. 4OR 20(2): 209-216 (2022) - [j17]Evgeny Gurevsky, Dmitry Kopelevich, Sergey Kovalev, Mikhail Y. Kovalyov:
Min-sum controllable risk problems with concave risk functions of the same value range. Networks 79(1): 105-116 (2022) - 2021
- [j16]Evgeny Gurevsky, Sergey Kovalev, Mikhail Y. Kovalyov:
Min-max controllable risk problems. 4OR 19(1): 93-101 (2021) - [j15]Xin Chen, Sergey Kovalev, Yuqing Liu, Malgorzata Sterna, Isabelle Chalamon, Jacek Blazewicz:
Semi-online scheduling on two identical machines with a common due date to maximize total early work. Discret. Appl. Math. 290: 71-78 (2021) - [j14]Sergey Kovalev, Isabelle Chalamon, Stéphane E. Collignon:
Minimizing maximum job dependent ergonomic risk. Int. J. Prod. Res. 59(1): 95-101 (2021) - [j13]S. Ehsan Hashemi-Petroodi, Alexandre Dolgui, Sergey Kovalev, Mikhail Y. Kovalyov, Simon Thevenin:
Workforce reconfiguration strategies in manufacturing systems: a state of the art. Int. J. Prod. Res. 59(22): 6721-6744 (2021) - [j12]Xin Chen, Sergey Kovalev, Malgorzata Sterna, Jacek Blazewicz:
Mirror scheduling problems with early work and late work criteria. J. Sched. 24(5): 483-487 (2021) - 2020
- [j11]S. Ehsan Hashemi-Petroodi, Simon Thevenin, Sergey Kovalev, Alexandre Dolgui:
Operations management issues in design and control of hybrid human-robot collaborative manufacturing systems: a survey. Annu. Rev. Control. 49: 264-276 (2020) - [c4]S. Ehsan Hashemi-Petroodi, Simon Thevenin, Sergey Kovalev, Alexandre Dolgui:
The Impact of Dynamic Tasks Assignment in Paced Mixed-Model Assembly Line with Moving Workers. APMS (2) 2020: 509-517
2010 – 2019
- 2019
- [j10]Xavier Delorme, Alexandre Dolgui, Sergey Kovalev, Mikhail Y. Kovalyov:
Minimizing the number of workers in a paced mixed-model assembly line. Eur. J. Oper. Res. 272(1): 188-194 (2019) - [j9]Sergey Kovalev, Mikhail Y. Kovalyov, Gur Mosheiov, Enrique Gerstl:
Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion. Int. J. Prod. Res. 57(2): 560-566 (2019) - [c3]Mohammed Bawatna, Bertram Green, Sergey Kovalev, Jan-Christoph Deinert, Oliver Knodel, Rainer G. Spallek:
Research and implementation of efficient parallel processing of big data at TELBE user facility. SummerSim 2019: 56:1-56:6 - [c2]Mohammed Bawatna, Bertram Green, Sergey Kovalev, Jan-Christoph Deinert, Oliver Knodel, Rainer G. Spallek:
Research and Implementation of Efficient Parallel Processing of Big Data at TELBE User Facility. SPECTS 2019: 1-6 - 2018
- [j8]Alexandre Dolgui, Sergey Kovalev, Mikhail Y. Kovalyov, Sergey Malyutin, Ameur Soukhal:
Optimal workforce assignment to operations of a paced assembly line. Eur. J. Oper. Res. 264(1): 200-211 (2018) - 2017
- [j7]Sergey Kovalev, Xavier Delorme, Alexandre Dolgui, Ammar Oulamara:
Minimizing the number of stations and station activation costs for a production line. Comput. Oper. Res. 79: 131-139 (2017) - 2015
- [j6]Sergey Kovalev:
Maximizing total tardiness on a single machine in O(n2) time via a reduction to half-product minimization. Ann. Oper. Res. 235(1): 815-819 (2015) - 2013
- [c1]Alexandre Dolgui, Sergey Kovalev, Mikhail Y. Kovalyov, Jenny Nossack, Erwin Pesch:
A Transfer Line Design Problem with Setup Times and Costs. MIM 2013: 778-783 - 2012
- [j5]Alexandre Dolgui, Sergey Kovalev:
Min-max and min-max (relative) regret approaches to representatives selection problem. 4OR 10(2): 181-192 (2012) - [j4]Pavel A. Borisovsky, Alexandre Dolgui, Sergey Kovalev:
Algorithms and implementation of a set partitioning approach for modular machining line design. Comput. Oper. Res. 39(12): 3147-3155 (2012) - [j3]Alexandre Dolgui, Sergey Kovalev:
Scenario based robust line balancing: Computational complexity. Discret. Appl. Math. 160(13-14): 1955-1963 (2012) - [j2]Sergey Kovalev, Xavier Delorme, Alexandre Dolgui:
Line configuration to minimize setup costs. Math. Comput. Model. 55(9-10): 2087-2095 (2012) - [j1]Pavel A. Borisovsky, Alexandre Dolgui, Sergey Kovalev:
Modelling transfer line design problem via a set partitioning problem. Optim. Lett. 6(5): 915-926 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
