Mikhail Y. Kovalyov

According to our database1, Mikhail Y. Kovalyov authored at least 109 papers between 1994 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


Lot-size scheduling of a single product on unrelated parallel machines.
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

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

Bi-criteria path problem with minimum length and maximum survival probability.
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

Minimizing the number of workers in a paced mixed-model assembly line.
Eur. J. Oper. Res., 2019

A parallel machine schedule updating game with compensations and clients averse to uncertain loss.
Comput. Oper. Res., 2019

Maximum Diversity Problem with Squared Euclidean Distance.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

No-idle Parallel Machine Scheduling of Unit-time Jobs.
Proceedings of the 6th International Conference on Control, 2019

An overview of revenue management and dynamic pricing models in hotel business.
RAIRO Oper. Res., 2018

A note on scheduling container storage operations of two non-passing stacking cranes.
Networks, 2018

Optimal workforce assignment to operations of a paced assembly line.
Eur. J. Oper. Res., 2018

Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72].
Theor. Comput. Sci., 2017

Knapsack problem with objective value gaps.
Optim. Lett., 2017

Graphs with maximal induced matchings of the same size.
Discret. Appl. Math., 2017

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

Decentralized sequencing of jobs on a single machine.
Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016

Two-agent scheduling with agent specific batches on an unbounded serial batching machine.
J. Sched., 2015

Two faster algorithms for coordination of production and batch delivery: A note.
Eur. J. Oper. Res., 2015

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

Scientific school of Academician V. S. Tanaev: Results on the scheduling theory.
Autom. Remote. Control., 2014

Erratum to: Internet shopping with price-sensitive discounts.
4OR, 2014

Internet shopping with price sensitive discounts.
4OR, 2014

Letter to the Editor.
Optim. Lett., 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

Lot-sizing on a single imperfect machine: ILP models and FPTAS extensions.
Comput. Ind. Eng., 2013

Strong NP-hardness of scheduling problems with learning or aging effect.
Ann. Oper. Res., 2013

A Transfer Line Design Problem with Setup Times and Costs.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Vyacheslav Tanaev: contributions to scheduling and related areas.
J. Sched., 2012

Editorial: new branches, old roots.
J. Sched., 2012

Scheduling jobs with position-dependent processing times.
J. Oper. Res. Soc., 2012

Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence.
Discret. Optim., 2012

Scheduling an unbounded batching machine with job processing time compatibilities.
Discret. Appl. Math., 2012

Soft due window assignment and scheduling of unit-time jobs on parallel machines.
4OR, 2012

Two-Agent Scheduling on an Unbounded Serial Batching Machine.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Minimizing the number of late jobs on a single machine under due date uncertainty.
J. Sched., 2011

The simplified partial digest problem: Approximation and a graph-theoretic model.
Eur. J. Oper. Res., 2011

Multi-product lot-sizing and sequencing on a single imperfect machine.
Comput. Optim. Appl., 2011

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

A generic approach to proving NP-hardness of partition type problems.
Discret. Appl. Math., 2010

Internet shopping optimization problem.
Int. J. Appl. Math. Comput. Sci., 2010

The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.
Discret. Appl. Math., 2009

On the approximability of the Simplified Partial Digest Problem.
Discret. Appl. Math., 2009

Batch scheduling of step deteriorating jobs.
J. Sched., 2008

Scheduling jobs in a contaminated area: a model and heuristic algorithms.
J. Oper. Res. Soc., 2008

Combinatorics for modern manufacturing, logistics and supply chains (ECCO XVIII).
Eur. J. Oper. Res., 2008

A single-item economic lot-sizing problem with a non-uniform resource: Approximation.
Eur. J. Oper. Res., 2008

Batch scheduling of deteriorating reworkables.
Eur. J. Oper. Res., 2008

A survey of scheduling problems with setup times or costs.
Eur. J. Oper. Res., 2008

Group sequencing around a common due date.
Discret. Optim., 2008

Lot-Sizing and Sequencing on a Single Imperfect Machine.
Proceedings of the Modelling, 2008

Soft Due Window Assignment and Scheduling on Parallel Machines.
IEEE Trans. Syst. Man Cybern. Part A, 2007

Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

Batching and scheduling in a multi-machine flow shop.
J. Sched., 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

Preemptable Malleable Task Scheduling Problem.
IEEE Trans. Computers, 2006

An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure.
Math. Program., 2006

Optimal testing and repairing a failed series system.
J. Comb. Optim., 2006

Job Sequencing with Exponential Functions of Processing Times.
Informatica, 2006

Scheduling in a contaminated area: A model and polynomial algorithms.
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

Batching work and rework processes with limited deterioration of reworkables.
Comput. Oper. Res., 2006

Single machine group scheduling with resource dependent setup and processing times.
Eur. J. Oper. Res., 2005

Positive half-products and scheduling with controllable processing times.
Eur. J. Oper. Res., 2005

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time.
Ann. Oper. Res., 2005

Single machine batch scheduling with jointly compressible setup and processing times.
Eur. J. Oper. Res., 2004

Batching decisions for assembly production systems.
Eur. J. Oper. Res., 2004

Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan.
Ann. Oper. Res., 2004

Maximization Problems in Single Machine Scheduling.
Ann. Oper. Res., 2004

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

Scheduling a Single Server in a Two-machine Flow Shop.
Computing, 2003

A polynomial algorithm for lot-size scheduling of two type tasks.
Inf. Process. Lett., 2002

Minimizing the total weighted completion time of deteriorating jobs.
Inf. Process. Lett., 2002

Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness.
J. Heuristics, 2002

Fast fully polynomial approximation schemes for minimizing completion time variance.
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

Single machine batch scheduling with resource dependent setup and processing times.
Eur. J. Oper. Res., 2001

Single Supplier Scheduling for Multiple Deliveries.
Ann. Oper. Res., 2001

Scheduling with batching: A review.
Eur. J. Oper. Res., 2000

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

Bicriterion Single Machine Scheduling with Resource Dependent Processing Times.
SIAM J. Optim., 1998

A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs.
J. Heuristics, 1998

Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints.
Discret. Appl. Math., 1998

Batch scheduling with deadlines on parallel machines.
Ann. Oper. Res., 1998

Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties.
SIAM J. Optim., 1997

A polynomial approximation scheme for problem F2/r<sub>j</sub>/C<sub>max</sub>.
Oper. Res. Lett., 1997

Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case.
Inf. Process. Lett., 1997

Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case.
Discret. Appl. Math., 1997

Single machine batch scheduling to minimize the weighted number of late jobs.
Math. Methods Oper. Res., 1996

Batch Scheduling and Common Due-date Assignment on a Single Machine.
Discret. Appl. Math., 1996

Improving the complexities of approximation algorithms for optimization problems.
Oper. Res. Lett., 1995

Single machine batch scheduling with deadlines and resource dependent processing times.
Oper. Res. Lett., 1995

Single machine group scheduling with ordered criteria.
Ann. Oper. Res., 1995

A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work.
Math. Oper. Res., 1994