default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail Y. Kovalyov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j120]Mikhail Y. Kovalyov, Katarzyna Anna Kuzmicz
, Mikhail N. Lukashevich, Erwin Pesch:
Planning container inspection and repair: A case study. Comput. Oper. Res. 164: 106555 (2024)- [j119]Nadia Brauner, Evgeny Gurevsky, Mikhail Y. Kovalyov:
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty. Discret. Appl. Math. 349: 106-112 (2024) - 2023
- [j118]Nir Halman, Mikhail Y. Kovalyov, Alain Quilliot:
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint. 4OR 21(2): 235-246 (2023) - [j117]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) - [j116]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) - [j115]Mikhail Y. Kovalyov, Mikhail N. Lukashevich, Erwin Pesch:
Cost minimizing planning of container inspection and repair in multiple facilities. OR Spectr. 45(1): 181-204 (2023) - 2022
- [j114]Anton V. Eremeev, Alexander V. Kel'manov, Mikhail Y. Kovalyov, Artem V. Pyatkin:
Selecting a subset of diverse points based on the squared euclidean distance. Ann. Math. Artif. Intell. 90(7-9): 965-977 (2022) - [j113]Xin Chen, Xuefeng Shen, Mikhail Y. Kovalyov, Malgorzata Sterna, Jacek Blazewicz:
Alternative algorithms for identical machines scheduling to maximize total early work with a common due date. Comput. Ind. Eng. 171: 108386 (2022) - [j112]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
- [j111]Evgeny Gurevsky, Sergey Kovalev, Mikhail Y. Kovalyov:
Min-max controllable risk problems. 4OR 19(1): 93-101 (2021) - [j110]Nadia Brauner, Mikhail Y. Kovalyov, Alain Quilliot, Hélène Toussaint:
No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines. Comput. Oper. Res. 132: 105315 (2021) - [j109]Nikolai Guschinsky, Mikhail Y. Kovalyov, Boris Rozin, Nadia Brauner:
Fleet and charging infrastructure decisions for fast-charging city electric bus service. Comput. Oper. Res. 135: 105449 (2021) - [j108]Mikhail Y. Kovalyov, Erwin Pesch, Alain Quilliot:
Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation. Eur. J. Oper. Res. 289(3): 1008-1012 (2021) - [j107]Andrei M. Bandalouski, Natalja G. Egorova, Mikhail Y. Kovalyov, Erwin Pesch, S. Armagan Tarim:
Dynamic pricing with demand disaggregation for hotel revenue management. J. Heuristics 27(5): 869-885 (2021) - [j106]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) - [j105]Ilia Fridman, Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
Fixed interval scheduling with third-party machines. Networks 77(3): 361-371 (2021) - 2020
- [j104]Mikhail Y. Kovalyov, Boris Rozin, N. N. Guschinsky:
Mathematical Model and Random Search Algorithm for the Optimal Planning Problem of Replacing Traditional Public Transport with Electric. Autom. Remote. Control. 81(5): 803-818 (2020) - [j103]Ali Diabat, Alexandre Dolgui, Wladyslaw A. Janiak, Mikhail Y. Kovalyov:
Three parallel task assignment problems with shared resources. IISE Trans. 52(4): 478-485 (2020) - [j102]Anton V. Eremeev, Mikhail Y. Kovalyov, Pavel M. Kuznetsov:
Lot-size scheduling of a single product on unrelated parallel machines. Optim. Lett. 14(3): 557-568 (2020) - [c8]Anton V. Eremeev, Mikhail Y. Kovalyov, Artem V. Pyatkin:
On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances. LION 2020: 40-45
2010 – 2019
- 2019
- [j101]Mikhail Y. Kovalyov, Dominik Kress, Sebastian Meiswinkel, Erwin Pesch:
A parallel machine schedule updating game with compensations and clients averse to uncertain loss. Comput. Oper. Res. 103: 148-157 (2019) - [j100]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) - [j99]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) - [j98]Mikhail Y. Kovalyov, Gur Mosheiov, Dmitrij Sesok:
Comments on "Proportionate flowshops with general position dependent processing times" [Inf. Process. Lett. 111 and "Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection" [Inf. Process. Lett. 132 (2018) 39-43]. Inf. Process. Lett. 147: 1-2 (2019) - [j97]Nir Halman, Mikhail Y. Kovalyov, Alain Quilliot, Dvir Shabtay, Moshe Zofi:
Bi-criteria path problem with minimum length and maximum survival probability. OR Spectr. 41(2): 469-489 (2019) - [j96]Mikhail Y. Kovalyov, Dmitrij Sesok:
Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity. J. Sched. 22(5): 603-606 (2019) - [j95]Alexander V. Kononov, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax. Theor. Comput. Sci. 793: 70-78 (2019) - [c7]Nadia Brauner, Mikhail Y. Kovalyov, Alain Quilliot, Hélène Toussaint:
No-idle Parallel Machine Scheduling of Unit-time Jobs. CoDIT 2019: 807-811 - [c6]Anton V. Eremeev, Alexander V. Kel'manov, Mikhail Y. Kovalyov, Artem V. Pyatkin:
Maximum Diversity Problem with Squared Euclidean Distance. MOTOR 2019: 541-551 - 2018
- [j94]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) - [j93]Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
A note on scheduling container storage operations of two non-passing stacking cranes. Networks 71(3): 271-280 (2018) - [j92]Andrei M. Bandalouski, Mikhail Y. Kovalyov, Erwin Pesch, S. Armagan Tarim:
An overview of revenue management and dynamic pricing models in hotel business. RAIRO Oper. Res. 52(1): 119-141 (2018) - 2017
- [j91]Philippe Baptiste, Mikhail Y. Kovalyov, Yury L. Orlovich, Frank Werner, Igor E. Zverovich:
Graphs with maximal induced matchings of the same size. Discret. Appl. Math. 216: 15-28 (2017) - [j90]Alessandro Agnetis, Mohamed Ali Aloulou, Mikhail Y. Kovalyov:
Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs. Int. J. Prod. Res. 55(20): 6193-6206 (2017) - [j89]Alexandre Dolgui, Mikhail Y. Kovalyov, Alain Quilliot:
Knapsack problem with objective value gaps. Optim. Lett. 11(1): 31-39 (2017) - [j88]Jianming Dong, Jueliang Hu, Mikhail Y. Kovalyov, Guohui Lin, Taibo Luo, Weitian Tong, Xueshi Wang, Yinfeng Xu:
Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72]. Theor. Comput. Sci. 687: 93-94 (2017) - 2016
- [j87]Oliver G. Czibula, Hanyu Gu, Feng-Jang Hwang, Mikhail Y. Kovalyov, Yakov Zinder:
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom. Comput. Oper. Res. 65: 53-63 (2016) - [j86]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Erhan Kozan, Erwin Pesch:
Corrigendum to 'Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs' [Information Sciences, 224 (2013) 109-117]. Inf. Sci. 357: 217 (2016) - [c5]Erwin Pesch, Mikhail Y. Kovalyov, Dominik Kress, Sebastian Meiswinkel:
Decentralized sequencing of jobs on a single machine. SSCI 2016: 1-7 - 2015
- [j85]Alessandro Agnetis, Mohamed Ali Aloulou, Liang-Liang Fu, Mikhail Y. Kovalyov:
Two faster algorithms for coordination of production and batch delivery: A note. Eur. J. Oper. Res. 241(3): 927-930 (2015) - [j84]Mikhail Y. Kovalyov, Ammar Oulamara, Ameur Soukhal:
Two-agent scheduling with agent specific batches on an unbounded serial batching machine. J. Sched. 18(4): 423-434 (2015) - 2014
- [j83]Jacek Blazewicz, Pascal Bouvry, Mikhail Y. Kovalyov, Jedrzej Musial:
Internet shopping with price sensitive discounts. 4OR 12(1): 35-48 (2014) - [j82]Jacek Blazewicz, Pascal Bouvry, Mikhail Y. Kovalyov, Jedrzej Musial:
Erratum to: Internet shopping with price-sensitive discounts. 4OR 12(4): 403-406 (2014) - [j81]Mikhail Y. Kovalyov, Yuri N. Sotskov, Yakov M. Shafransky:
Scientific school of Academician V. S. Tanaev: Results on the scheduling theory. Autom. Remote. Control. 75(7): 1241-1256 (2014) - [j80]F. J. Hwang, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence. Ann. Oper. Res. 217(1): 263-279 (2014) - [j79]Chi To Ng, Tai Chiu Edwin Cheng, Andrei M. Bandalouski, Mikhail Y. Kovalyov, Sze Sing Lam:
A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines. J. Oper. Res. Soc. 65(10): 1571-1579 (2014) - 2013
- [j78]Adam Janiak, Mikhail Y. Kovalyov, Maciej Lichtenstein:
Strong NP-hardness of scheduling problems with learning or aging effect. Ann. Oper. Res. 206(1): 577-583 (2013) - [j77]Kseniya Schemeleva, Xavier Delorme, Alexandre Dolgui, Frédéric Grimaud, Mikhail Y. Kovalyov:
Lot-sizing on a single imperfect machine: ILP models and FPTAS extensions. Comput. Ind. Eng. 65(4): 561-569 (2013) - [j76]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Erhan Kozan, Erwin Pesch:
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. Inf. Sci. 224: 109-117 (2013) - [j75]Alexandre Dolgui, Anton V. Eremeev, Mikhail Y. Kovalyov, Viatcheslav S. Sigaev:
Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines. J. Math. Model. Algorithms Oper. Res. 12(2): 155-165 (2013) - [j74]Adam Janiak, Maciej Lichtenstein, Mikhail Y. Kovalyov:
Comment on 'the strong NP-completeness of 3-PARTITION problem with Bkm' by Zhongyi Jiang, Fangfang Chen, Chunqing Wu. J. Oper. Res. Soc. 64(5): 787 (2013) - [j73]Adam Janiak, Mikhail Y. Kovalyov:
Letter to the Editor. Optim. Lett. 7(5): 1045 (2013) - [c4]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
- [j72]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Frank Werner:
Soft due window assignment and scheduling of unit-time jobs on parallel machines. 4OR 10(4): 347-360 (2012) - [j71]Adrien Bellanger, Adam Janiak, Mikhail Y. Kovalyov, Ammar Oulamara:
Scheduling an unbounded batching machine with job processing time compatibilities. Discret. Appl. Math. 160(1-2): 15-23 (2012) - [j70]F. J. Hwang, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. Discret. Optim. 9(1): 29-39 (2012) - [j69]Adam Janiak, Mikhail Y. Kovalyov:
Scheduling jobs with position-dependent processing times. J. Oper. Res. Soc. 63(7): 1018-1020 (2012) - [j68]Jacek Blazewicz, Edmund K. Burke, Valery S. Gordon, Mikhail Y. Kovalyov, Yakov M. Shafransky, Vitaly A. Strusevich:
Editorial: new branches, old roots. J. Sched. 15(4): 399-401 (2012) - [j67]Valery S. Gordon, Mikhail Y. Kovalyov, G. M. Levin, Yakov M. Shafransky, Yuri N. Sotskov, Vitaly A. Strusevich, Alexander V. Tuzikov:
Vyacheslav Tanaev: contributions to scheduling and related areas. J. Sched. 15(4): 403-418 (2012) - [c3]Mikhail Y. Kovalyov, Ammar Oulamara, Ameur Soukhal:
Two-Agent Scheduling on an Unbounded Serial Batching Machine. ISCO 2012: 427-438 - 2011
- [j66]Alexandre Dolgui, Mikhail Y. Kovalyov, Kseniya Shchamialiova:
Multi-product lot-sizing and sequencing on a single imperfect machine. Comput. Optim. Appl. 50(3): 465-482 (2011) - [j65]Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov:
The simplified partial digest problem: Approximation and a graph-theoretic model. Eur. J. Oper. Res. 208(2): 142-152 (2011) - [j64]Hassene Aissi, Mohamed Ali Aloulou, Mikhail Y. Kovalyov:
Minimizing the number of late jobs on a single machine under due date uncertainty. J. Sched. 14(4): 351-360 (2011) - 2010
- [j63]Jacek Blazewicz, Mikhail Y. Kovalyov, Jedrzej Musial, Andrzej P. Urbanski, Adam Wojciechowski:
Internet shopping optimization problem. Int. J. Appl. Math. Comput. Sci. 20(2): 385-390 (2010) - [j62]Mikhail Y. Kovalyov, Erwin Pesch:
A generic approach to proving NP-hardness of partition type problems. Discret. Appl. Math. 158(17): 1908-1912 (2010) - [j61]Adrien Bellanger, Ammar Oulamara, Mikhail Y. Kovalyov:
Minimizing total completion time on a batching machine with job processing time compatibilities. Electron. Notes Discret. Math. 36: 1295-1302 (2010) - [j60]C. T. Ng, Mikhail Y. Kovalyov, T. C. E. Cheng:
A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure. Eur. J. Oper. Res. 200(2): 621-624 (2010) - [j59]C. T. Ng, M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kovalyov:
"Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation. Eur. J. Oper. Res. 207(2): 601-604 (2010)
2000 – 2009
- 2009
- [j58]C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov:
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. Discret. Appl. Math. 157(8): 1806-1824 (2009) - [j57]Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov:
On the approximability of the Simplified Partial Digest Problem. Discret. Appl. Math. 157(17): 3586-3592 (2009) - 2008
- [j56]T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, Sze Sing Lam:
Group sequencing around a common due date. Discret. Optim. 5(3): 594-604 (2008) - [j55]Ali Allahverdi, C. T. Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov:
A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3): 985-1032 (2008) - [j54]Mikhail Y. Kovalyov, Silvano Martello:
Combinatorics for modern manufacturing, logistics and supply chains (ECCO XVIII). Eur. J. Oper. Res. 189(3): 803-806 (2008) - [j53]Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch:
A single-item economic lot-sizing problem with a non-uniform resource: Approximation. Eur. J. Oper. Res. 189(3): 877-889 (2008) - [j52]M. S. Barketau, T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Batch scheduling of deteriorating reworkables. Eur. J. Oper. Res. 189(3): 1317-1326 (2008) - [j51]Adam Janiak, Mikhail Y. Kovalyov:
Scheduling jobs in a contaminated area: a model and heuristic algorithms. J. Oper. Res. Soc. 59(7): 977-987 (2008) - [j50]M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov:
Batch scheduling of step deteriorating jobs. J. Sched. 11(1): 17-28 (2008) - [c2]Alexandre Dolgui, Mikhail Y. Kovalyov, Kseniya Shchamialiova:
Lot-Sizing and Sequencing on a Single Imperfect Machine. MCO 2008: 117-125 - 2007
- [j49]Mikhail Y. Kovalyov, Frank Werner:
Problem F2∥Cmax with forbidden jobs in the first or last position is easy. Eur. J. Oper. Res. 177(2): 1310-1311 (2007) - [j48]Mikhail Y. Kovalyov, C. T. Ng, T. C. Edwin Cheng:
Fixed interval scheduling: Models, applications, computational complexity and algorithms. Eur. J. Oper. Res. 178(2): 331-342 (2007) - [j47]Fawaz S. Al-Anzi, Ali Allahverdi, Mikhail Y. Kovalyov:
Batching deteriorating items with applications in computer communication and reverse logistics. Eur. J. Oper. Res. 182(3): 1002-1011 (2007) - [j46]Mohamed Ali Aloulou, Mikhail Y. Kovalyov, Marie-Claude Portmann:
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity. RAIRO Oper. Res. 41(1): 1-18 (2007) - [j45]C. T. Ng, Mikhail Y. Kovalyov:
Batching and scheduling in a multi-machine flow shop. J. Sched. 10(6): 353-364 (2007) - [j44]Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov:
Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4): 668-680 (2007) - [j43]Adam Janiak, Mikhail Y. Kovalyov, Marcin Marek:
Soft Due Window Assignment and Scheduling on Parallel Machines. IEEE Trans. Syst. Man Cybern. Part A 37(5): 614-620 (2007) - 2006
- [j42]Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov, Frank Werner:
Batching work and rework processes with limited deterioration of reworkables. Comput. Oper. Res. 33: 1595-1605 (2006) - [j41]Adam Janiak, Mikhail Y. Kovalyov:
Scheduling in a contaminated area: A model and polynomial algorithms. Eur. J. Oper. Res. 173(1): 125-132 (2006) - [j40]T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich:
Scheduling with controllable release dates and processing times: Makespan minimization. Eur. J. Oper. Res. 175(2): 751-768 (2006) - [j39]T. C. Edwin Cheng, Mikhail Y. Kovalyov, Natalia V. Shakhlevich:
Scheduling with controllable release dates and processing times: Total completion time minimization. Eur. J. Oper. Res. 175(2): 769-781 (2006) - [j38]Adam Janiak, Mikhail Y. Kovalyov:
Job Sequencing with Exponential Functions of Processing Times. Informatica 17(1): 13-24 (2006) - [j37]Mikhail Y. Kovalyov, Marie-Claude Portmann, Ammar Oulamara:
Optimal testing and repairing a failed series system. J. Comb. Optim. 12(3): 279-295 (2006) - [j36]Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch:
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. Math. Program. 106(3): 453-466 (2006) - [j35]Jacek Blazewicz, Mikhail Y. Kovalyov, Maciej Machowiak, Denis Trystram, Jan Weglarz:
Preemptable Malleable Task Scheduling Problem. IEEE Trans. Computers 55(4): 486-490 (2006) - 2005
- [j34]C. T. Ng, T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov:
Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time. Ann. Oper. Res. 133(1-4): 163-174 (2005) - [j33]Adam Janiak, Mikhail Y. Kovalyov, Marie-Claude Portmann:
Single machine group scheduling with resource dependent setup and processing times. Eur. J. Oper. Res. 162(1): 112-121 (2005) - [j32]Adam Janiak, Mikhail Y. Kovalyov, Wieslaw Kubiak, Frank Werner:
Positive half-products and scheduling with controllable processing times. Eur. J. Oper. Res. 165(2): 416-422 (2005) - 2004
- [j31]Mohamed Ali Aloulou, Mikhail Y. Kovalyov, Marie-Claude Portmann:
Maximization Problems in Single Machine Scheduling. Ann. Oper. Res. 129(1-4): 21-32 (2004) - [j30]Jacek Blazewicz, Maciej Machowiak, Jan Weglarz, Mikhail Y. Kovalyov, Denis Trystram:
Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan. Ann. Oper. Res. 129(1-4): 65-80 (2004) - [j29]C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Single machine batch scheduling with jointly compressible setup and processing times. Eur. J. Oper. Res. 153(1): 211-219 (2004) - [j28]Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich:
Batching decisions for assembly production systems. Eur. J. Oper. Res. 157(3): 620-642 (2004) - 2003
- [j27]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Scheduling a Single Server in a Two-machine Flow Shop. Computing 70(2): 167-180 (2003) - [j26]C. T. Daniel Ng, T. C. Edwin Cheng, Mikhail Y. Kovalyov, Sze Sing Lam:
Single machine scheduling with a variable common due date and resource-dependent processing times. Comput. Oper. Res. 30(8): 1173-1185 (2003) - [j25]C. T. Daniel Ng, T. C. E. Cheng, Mikhail Y. Kovalyov:
Batch scheduling with controllable setup and processing times to minimize total completion time. J. Oper. Res. Soc. 54(5): 499-506 (2003) - 2002
- [j24]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. Comput. Oper. Res. 29(14): 2087-2091 (2002) - [j23]Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyov:
Fast fully polynomial approximation schemes for minimizing completion time variance. Eur. J. Oper. Res. 137(2): 303-309 (2002) - [j22]Mikhail Y. Kovalyov, Frank Werner:
Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness. J. Heuristics 8(4): 415-428 (2002) - [j21]Aleksander Bachman, Adam Janiak, Mikhail Y. Kovalyov:
Minimizing the total weighted completion time of deteriorating jobs. Inf. Process. Lett. 81(2): 81-84 (2002) - [j20]Mikhail Y. Kovalyov, Marcus Pattloch, Günter Schmidt:
A polynomial algorithm for lot-size scheduling of two type tasks. Inf. Process. Lett. 83(4): 229-235 (2002) - [c1]Aleksander Bachman, Adam Janiak, Mikhail Y. Kovalyov:
Single Machine Scheduling Problems with Exponentially Start Time Dependent Job Processing Times. OR 2002: 211-216 - 2001
- [j19]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Single Supplier Scheduling for Multiple Deliveries. Ann. Oper. Res. 107(1-4): 51-63 (2001) - [j18]T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov:
Single machine batch scheduling with resource dependent setup and processing times. Eur. J. Oper. Res. 135(1): 177-183 (2001) - 2000
- [j17]Chris N. Potts, Mikhail Y. Kovalyov:
Scheduling with batching: A review. Eur. J. Oper. Res. 120(2): 228-249 (2000)
1990 – 1999
- 1999
- [j16]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness. Eur. J. Oper. Res. 114(2): 403-410 (1999) - [j15]Mikhail Y. Kovalyov, Wieslaw Kubiak:
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem. Oper. Res. 47(5): 757-761 (1999) - 1998
- [j14]Peter Brucker, Mikhail Y. Kovalyov, Yakov M. Shafransky, Frank Werner:
Batch scheduling with deadlines on parallel machines. Ann. Oper. Res. 83: 23-40 (1998) - [j13]Mikhail Y. Kovalyov, Yakov M. Shafransky:
Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints. Discret. Appl. Math. 84(1-3): 253-257 (1998) - [j12]Mikhail Y. Kovalyov, Wieslaw Kubiak:
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. J. Heuristics 3(4): 287-297 (1998) - [j11]T. C. Edwin Cheng, Adam Janiak, Mikhail Y. Kovalyov:
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times. SIAM J. Optim. 8(2): 617-630 (1998) - 1997
- [j10]Mikhail Y. Kovalyov:
Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case. Discret. Appl. Math. 80(2-3): 251-254 (1997) - [j9]Mikhail Y. Kovalyov, Yakov M. Shafransky:
Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case. Inf. Process. Lett. 64(2): 69-74 (1997) - [j8]Mikhail Y. Kovalyov, Frank Werner:
A polynomial approximation scheme for problem F2/rj/Cmax. Oper. Res. Lett. 20(2): 75-79 (1997) - [j7]T. C. Edwin Cheng, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties. SIAM J. Optim. 7(2): 547-559 (1997) - 1996
- [j6]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Batch Scheduling and Common Due-date Assignment on a Single Machine. Discret. Appl. Math. 70(3): 231-245 (1996) - [j5]Peter Brucker, Mikhail Y. Kovalyov:
Single machine batch scheduling to minimize the weighted number of late jobs. Math. Methods Oper. Res. 43(1): 1-8 (1996) - 1995
- [j4]Adam Janiak, Mikhail Y. Kovalyov:
Single machine group scheduling with ordered criteria. Ann. Oper. Res. 57(1): 191-201 (1995) - [j3]Mikhail Y. Kovalyov:
Improving the complexities of approximation algorithms for optimization problems. Oper. Res. Lett. 17(2): 85-87 (1995) - [j2]T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Single machine batch scheduling with deadlines and resource dependent processing times. Oper. Res. Lett. 17(5): 243-249 (1995) - 1994
- [j1]Mikhail Y. Kovalyov, Chris N. Potts, Luk N. Van Wassenhove:
A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work. Math. Oper. Res. 19(1): 86-93 (1994)
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 21:23 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:
