Mikhail Y. Kovalyov
Orcid: 0000-0003-0832-0829
According to our database1,
Mikhail Y. Kovalyov
authored at least 128 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty.
Discret. Appl. Math., 2024
2023
4OR, September, 2023
Single machine scheduling with assignable due dates to minimize maximum and total late work.
Eur. J. Oper. Res., July, 2023
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint.
4OR, June, 2023
OR Spectr., March, 2023
2022
Min-sum controllable risk problems with concave risk functions of the same value range.
Networks, 2022
Alternative algorithms for identical machines scheduling to maximize total early work with a common due date.
Comput. Ind. Eng., 2022
Ann. Math. Artif. Intell., 2022
2021
Int. J. Prod. Res., 2021
J. Heuristics, 2021
Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation.
Eur. J. Oper. Res., 2021
Fleet and charging infrastructure decisions for fast-charging city electric bus service.
Comput. Oper. Res., 2021
No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines.
Comput. Oper. Res., 2021
2020
Optim. Lett., 2020
Mathematical Model and Random Search Algorithm for the Optimal Planning Problem of Replacing Traditional Public Transport with Electric.
Autom. Remote. Control., 2020
On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020
2019
Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem <i>P</i>||<i>C</i><sub>max</sub>.
Theor. Comput. Sci., 2019
Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity.
J. Sched., 2019
OR Spectr., 2019
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., 2019
Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion.
Int. J. Prod. Res., 2019
Eur. J. Oper. Res., 2019
A parallel machine schedule updating game with compensations and clients averse to uncertain loss.
Comput. Oper. Res., 2019
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
Proceedings of the 6th International Conference on Control, 2019
2018
RAIRO Oper. Res., 2018
A note on scheduling container storage operations of two non-passing stacking cranes.
Networks, 2018
Eur. J. Oper. Res., 2018
2017
Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72].
Theor. Comput. Sci., 2017
Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs.
Int. J. Prod. Res., 2017
2016
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., 2016
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom.
Comput. Oper. Res., 2016
Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016
2015
Two-agent scheduling with agent specific batches on an unbounded serial batching machine.
J. Sched., 2015
Eur. J. Oper. Res., 2015
2014
A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines.
J. Oper. Res. Soc., 2014
Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence.
Ann. Oper. Res., 2014
Autom. Remote. Control., 2014
2013
Comment on 'the strong NP-completeness of 3-PARTITION problem with B<i>k<sup>m</sup></i>' by Zhongyi Jiang, Fangfang Chen, Chunqing Wu.
J. Oper. Res. Soc., 2013
Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines.
J. Math. Model. Algorithms Oper. Res., 2013
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs.
Inf. Sci., 2013
Comput. Ind. Eng., 2013
Ann. Oper. Res., 2013
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013
2012
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence.
Discret. Optim., 2012
Discret. Appl. Math., 2012
4OR, 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
2011
J. Sched., 2011
Eur. J. Oper. Res., 2011
Comput. Optim. Appl., 2011
2010
A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure.
Eur. J. Oper. Res., 2010
"Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation.
Eur. J. Oper. Res., 2010
Minimizing total completion time on a batching machine with job processing time compatibilities.
Electron. Notes Discret. Math., 2010
Discret. Appl. Math., 2010
2009
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.
Discret. Appl. Math., 2009
Discret. Appl. Math., 2009
2008
J. Oper. Res. Soc., 2008
Eur. J. Oper. Res., 2008
A single-item economic lot-sizing problem with a non-uniform resource: Approximation.
Eur. J. Oper. Res., 2008
Proceedings of the Modelling, 2008
2007
IEEE Trans. Syst. Man Cybern. Part A, 2007
IEEE ACM Trans. Comput. Biol. Bioinform., 2007
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity.
RAIRO Oper. Res., 2007
Problem F2∥C<sub>max</sub> with forbidden jobs in the first or last position is easy.
Eur. J. Oper. Res., 2007
Fixed interval scheduling: Models, applications, computational complexity and algorithms.
Eur. J. Oper. Res., 2007
Batching deteriorating items with applications in computer communication and reverse logistics.
Eur. J. Oper. Res., 2007
2006
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure.
Math. Program., 2006
Eur. J. Oper. Res., 2006
Scheduling with controllable release dates and processing times: Total completion time minimization.
Eur. J. Oper. Res., 2006
Scheduling with controllable release dates and processing times: Makespan minimization.
Eur. J. Oper. Res., 2006
Comput. Oper. Res., 2006
2005
Eur. J. Oper. Res., 2005
Eur. J. Oper. Res., 2005
Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time.
Ann. Oper. Res., 2005
2004
Single machine batch scheduling with jointly compressible setup and processing times.
Eur. J. Oper. Res., 2004
Ann. Oper. Res., 2004
2003
Batch scheduling with controllable setup and processing times to minimize total completion time.
J. Oper. Res. Soc., 2003
Single machine scheduling with a variable common due date and resource-dependent processing times.
Comput. Oper. Res., 2003
2002
Inf. Process. Lett., 2002
Inf. Process. Lett., 2002
Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness.
J. Heuristics, 2002
Eur. J. Oper. Res., 2002
An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note.
Comput. Oper. Res., 2002
Single Machine Scheduling Problems with Exponentially Start Time Dependent Job Processing Times.
Proceedings of the Operations Research Proceedings 2002, 2002
2001
Eur. J. Oper. Res., 2001
2000
1999
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem.
Oper. Res., 1999
Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness.
Eur. J. Oper. Res., 1999
1998
SIAM J. Optim., 1998
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs.
J. Heuristics, 1998
Discret. Appl. Math., 1998
1997
SIAM J. Optim., 1997
Oper. Res. Lett., 1997
Inf. Process. Lett., 1997
Discret. Appl. Math., 1997
1996
Math. Methods Oper. Res., 1996
Discret. Appl. Math., 1996
1995
Oper. Res. Lett., 1995
Single machine batch scheduling with deadlines and resource dependent processing times.
Oper. Res. Lett., 1995
1994
A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work.
Math. Oper. Res., 1994