Mikhail Y. Kovalyov

Mikhail Y. Kovalyov
United Institute Of Informatics Problems

Dr.Sc., Ph.D.

About

217
Publications
20,432
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
5,853
Citations
Additional affiliations
September 2002 - March 2009
Belarusian State University
Position
  • Professor (Full)
October 1982 - present
National Academy of Sciences of Belarus
Position
  • Deputy General Director for Research
October 1982 - present
United Institute Of Informatics Problems
United Institute Of Informatics Problems
Position
  • Deputy General Director for Research

Publications

Publications (217)
Article
Full-text available
Max–max, max–min, min–max and min–min optimization problems with a knapsack-type constraint containing a single numerical parameter are studied. The goal is to present optimal solutions for all possible values of the parameter. Algorithms with O(nlogn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \use...
Article
Full-text available
Integer knapsack problems with profit functions of the same value range are studied. Linear time algorithms are presented for the case of convex non-decreasing profit functions, and an NP-hardness proof and a fully polynomial-time approximation scheme are provided for the case of arbitrary non-negative non-decreasing profit functions. Fast solution...
Article
Full-text available
In this paper we present a novel approach to the dynamic pricing problem for hotel businesses. It includes disaggregation of the demand into several categories, forecasting, elastic demand simulation, and a mathematical programming model with concave quadratic objective function and linear constraints for dynamic price optimization. The approach is...
Article
Full-text available
In this paper we consider two closely related problems of selecting a diverse subset of points with respect to squared Euclidean distance. Given a set of points in Euclidean space, the first problem is to find a subset of a specified size M maximizing the sum of squared Euclidean distances between the chosen points. The second problem asks for a mi...
Article
Decision aspects concerning the introduction of fast-charging city electric buses are studied in this paper. The main studied problem consists of determining a fleet of electric buses and their charging infrastructure such that a social-ecological value is maximized. In the most representative time period, all the electric buses should be available...
Article
A min‐sum controllable risk problem, defined on a given set of elements or on combinatorial structures, which are either paths of a directed acyclic graph or spanning trees of an undirected graph, with resource‐dependent risk functions of the elements, is studied. The resource amount is limited, and the objective is to distribute it between the sel...
Article
A problem of scheduling n unit-time jobs with a small number of distinct release dates and deadlines, on identical parallel machines, to minimize the number of active machines is studied. The feature that makes this problem challenging is that no machine can stand idle between its start and completion times. A number of properties of this problem i...
Article
Full-text available
A min-max controllable risk problem, defined on combinatorial structures which are either simple paths of a directed multigraph or spanning trees of an undirected multigraph, with resource dependent risk functions of the arcs or the edges, is studied. The resource amount is limited, and the objective is to distribute it between the arcs or the edge...
Article
Full-text available
We study a problem to decide which of the two manufacturing configurations – dedicated lines or a single multi-model manufacturing line – is economically more preferable for manufacturing products of several types in a given time period. The goal of employing any of the two configurations is to maximize the total profit, subject to the product dema...
Article
This paper provides a literature review and an analysis of the studies related to workforce reconfiguration strategies as a part of workforce planning for various production environments. The survey demonstrates that these strategies play a crucial role in the resilience and flexibility of manufacturing systems since they help industrial companies...
Article
Full-text available
We study a problem of scheduling n jobs on machines of two types: in‐house machines and third‐party machines. Scheduling on in‐house machines incurs no additional costs, while using third‐party machines implies costs depending on their number and the time of usage. Each job has a fixed time interval for being processed which can be divided and allo...
Chapter
In this paper, we consider the problem of finding a minimum cardinality subset of vectors, given a constraint on the sum of squared Euclidean distances between all vectors of the chosen subset. This problem is closely related to the well-known Maximum Diversity Problem. The main difference consists in swapping the constraint with the optimization c...
Article
We investigate the complex optimization problem that arises in the planning of the transition process from traditional public transport to electric transport. We define the assumptions, input and output parameters of the problem, as well as its mathematical model and a randomized algorithm for solving it. We also give an extensive bibliography of p...
Article
Full-text available
We study a problem in which at least a given quantity of a single product has to be partitioned into lots, and lots have to be assigned to the unrelated parallel machines for processing so that the maximum machine completion time or the sum of machine completion times is minimized. Machine dependent lower and upper bounds on the lot size are given....
Article
Full-text available
We study three optimization problems in which non-renewable resources are used to execute tasks in parallel. Problems differentiate by the assumptions of whether a resource can be shared between several tasks or not, or whether resource sharing between the tasks is limited. We present very efficient solution procedures for two of these problems and...
Article
Tang et al. (Eur J Oper Res 263:401–411, 2017) have recently introduced a parallel-batching machine scheduling problem with linearly deteriorating jobs of two agents and presented a computational complexity classification of various special cases of this problem, including a number of NP-hardness proofs. We refine these results by demonstrating str...
Article
Braverman et al. [Math. Oper. Res. 41(1), (2016), pp. 352–376], introduce the problem Provision-after-Wait which is to find a stable (envy free) assignment of n patients to m hospitals, and their waiting times before admission, such that the social welfare is maximized, subject to a limited budget. Chan et al. [ACM Trans. Econ. Comput. 5(2), (2017)...
Chapter
In this paper we consider the following Maximum Diversity Subset problem. Given a set of points in Euclidean space, find a subset of size M maximizing the squared Euclidean distances between the chosen points. We propose an exact dynamic programming algorithm for the case of integer input data. If the dimension of the Euclidean space is bounded by...
Article
Full-text available
We study a bi-criteria path problem on a directed multigraph with cycles, where each arc is associated with two parameters. The first is the survival probability of moving along the arc, and the second is the length of the arc. We evaluate the quality of a path by two independent criteria. The first is to maximize the survival probability along the...
Chapter
In this paper we consider the following Maximum Diversity Subset problem. Given a set of points in Euclidean space, find a subset of size M maximizing the squared Euclidean distances between the chosen points. We propose an exact dynamic programming algorithm for the case of integer input data. If the dimension of the Euclidean space is bounded by...
Article
Bi-criteria lexicographical minimization problems with the makespan as the primary objective and the total machine assignment costs as the secondary objective have been recently introduced to the scheduling research, and polynomial time (r+1,1)-approximation algorithms have been suggested for their solution, where 1<r<2 is the performance ratio of...
Article
Mosheiov [4] and Fiszman and Mosheiov [2] studied flowshop scheduling problems with position dependent job processing times and proposed algorithms which employ solving an assignment problem as a subroutine. This subroutine needs a correction. We describe such a correction. The running times of the corrected algorithms match the best known running...
Article
In today’s global competition, manufacturing systems must become more and more flexible and reconfigurable to respond quickly and efficiently to market demand changes. Contrarily to machines, humans are agile and able to work with different equipment in different conditions. Consequently, employment of human workers leads to more flexible and more...
Article
Full-text available
The paper is an extension of the same name plenary report at the conference “Innovations in mechanical engineering-2018”, which has been held in Minsk, Belarus, on September 18–19, 2018. Essential functionalities of the project PLATON (Planning Process and Tool for Step-by-Step Conversion of the Conventional or Mixed Bus Fleet to a 100% Electric Bu...
Article
There is a finite number of non-cooperating clients, who are averse to uncertain loss and compete for execution of their jobs not later than by their respective due dates in a parallel service environment. For each client, a due date violation implies a cost. In order to address the minimization of the total scheduling cost of all clients as a soci...
Chapter
We consider a bi-objective optimization problem of choosing the buffers capacity in a production system of parallel tandem lines, each consisting of two machines with a single intermediate buffer. During operation of the system, the equipment stops occur due to failures and these stops are random in the moments when they arise and in their duration...
Article
Full-text available
We study a problem of minimizing the maximum number of identical workers over all cycles of a paced assembly line comprised of m stations and executing n parts of k types. There are lower and upper bounds on the workforce requirements and the cycle time constraints. We show that this problem is equivalent to the same problem without the cycle time...
Article
The problem of minimising total absolute deviation of job completion times in a two-machine no-wait proportionate flow shop has been recently studied. It was shown that the LPT (largest processing time first) job sequence is optimal if the number of jobs n does not exceed 7, and that the LPT sequence is not optimal for instances with . We prove tha...
Article
Full-text available
We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximati...
Article
Full-text available
A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of
Article
Basic concepts and brief description of revenue management models and decision tools in the hotel business are presented. An overview of the relevant literature on dynamic pricing, forecasting methods and optimization models is provided. The main ideas of the authors' customized revenue management method for the hotel business are presented.
Article
Full-text available
We consider a problem in which at least a given quantity of a single product has to be partitioned into lots, and lots have to be assigned to unrelated parallel machines for processing. In one version of the problem, the maximum machine completion time should be minimized, in another version of the problem, the sum of machine completion times is to...
Article
We study a scheduling problem for a container block, in which there are incoming containers only. Container placement is served by two non-passing stacking cranes based at the opposite sides of the container block. The same time is required for any crane to move between two adjacent bays of the container block and the same different time is require...
Article
In this paper, we address a model for supply chain coordination. There are m manufacturers modelled as single machines, each of which processes a specific set of jobs (products). After processing is completed, jobs are batched, and batches are shipped to a customer by means of vehicles. The problem consists in concurrently finding a production sche...
Article
Full-text available
We study a paced assembly line intended for manufacturing different products. Workers with identical skills perform non-preemptable operations whose assignment to stations is known. Operations assigned to the same station are executed sequentially, and they should follow the given precedence relations. Operations assigned to different stations can...
Article
Full-text available
We study a 0-1 knapsack problem, in which the objective value is forbidden to take some values. We call gaps related forbidden intervals. The problem is NP-hard and pseudo-polynomially solvable independently on the measure of gaps. If the gaps are large, then the problem is polynomially non-approximable. A non-trivial special case with respect to t...
Chapter
Pedestrians usually walk on sidewalks if available or on special ways where cars are not allowed. The main goal of this work is to enable a route search for pedestrians which mainly orients on sidewalks not on roads. For this, we create a routable graph from OpenStreetMap—consisting of nodes and edges—which exactly represents the ways actually used...
Article
Supply chain coordination problems involve a number of actors, namely suppliers, manufacturers, 3PL providers, and customers. In a typical scenario, there are m manufacturers (modeled as single machines), each of which processes a specific set of jobs (products). After their processing is completed, products are shipped to a customer by means of ve...
Conference Paper
There is a finite number of non-cooperating clients competing for execution of their jobs by a single service provider in order to minimize job completion time costs. The clients can move their jobs to complete earlier in a given sequence. However, they have to compensate the cost increase to the other clients whose jobs are completed later due to...
Article
A graph is . well-indumatched if all its maximal induced matchings are of the same size. We first prove that recognizing whether a graph is well-indumatched is a co-NP-complete problem even for . (2P5,K1,5)-free graphs. We then show that decision problems . Independent Dominating Set, . Independent Set, and . Dominating Set are NP-complete for the...
Article
Full-text available
We consider a paced line that produces various products and consists of several assembly stations. Each product or semi-product requires a specific set of operations to be performed by identical workers. The assignment of operations to the stations and precedence relations between the operations are known. Operations assigned to different stations...
Article
The problem of minimizing total helicopter passenger risk caused by takeoffs and landings is studied. There are passenger pickup and delivery demands to be satisfied at given points by flights starting and ending in the same heliport and visiting several points. For each point, the delivery demand is the number of passengers to be transported from...
Article
This note suggests faster algorithms for two integrated production/distribution problems studied earlier, improving their complexities from O(n2V + 4) and O(n2(L + V)2) to O(n) and O(n + Vmin {V, n}) respectively, where n is the number of products to be delivered, V is the number of vehicles and L is the number of vehicle departure times.
Article
We study a scheduling problem, in which jobs of two agents are performed in agent specific batches on the same serial unbounded batching machine. On this machine, jobs of the same batch complete simultaneously, and the batch processing time is equal to the total processing time of its jobs plus a setup time. Each agent aims at minimizing a function...
Article
Full-text available
A fully polynomial time approximation scheme (FPTAS) with run time
Article
We study the problem of scheduling n non-preemptive jobs on m unrelated parallel machines. Each machine can process a specified subset of the jobs. If a job is assigned to a machine, then it occupies a specified time interval on the machine. Each assignment of a job to a machine yields a value. The objective is to find a subset of the jobs and thei...
Article
Full-text available
In Blazewich et al. (4OR-Q J Oper Res 12(1):35–48, 2014), an Internet shopping problem with price-sensitive discounts was introduced, in which a customer wants to buy a given set of products in a given set of Internet shops. This problem is an extension of the original Internet shopping optimization problem (ISOP) presented in Blazewich et al. (Int...
Article
We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be...
Article
The results on the scheduling theory as obtained by the followers of the scientific school of Academician V.S. Tanaev were structured in terms of subjects.
Article
Full-text available
The problem of scheduling n tasks in a multiprocessor system with m processors to minimize the makespan is studied. Tasks are malleable, which means that a task can be executed by several processors at a time, its processing speed depends on the number of allocated processors, and a set of processors allocated to the same task can change over time....
Article
This paper studies a problem of scheduling fabrication and assembly operations in a two-machine flowshop, subject to the same predetermined job sequence on each machine. In the manufacturing setting, there are n products, each of which consists of two components: a common component and a unique component which are fabricated on machine 1 and then a...
Article
Full-text available
Non-deterministic lot-sizing models are considered which serve for an explicit determination of lot sizes in an uncertain environment. Taxonomy components for such models are suggested and a bibliography structured according to these components is presented. The taxonomy components are numeric characteristics of a lot-sizing problem, names of uncer...
Article
A problem is studied in which several non-cooperating clients compete for earlier execution of their jobs in a processing sequence of a single service provider in order to minimize job completion time costs. The clients can move their jobs earlier in a given sequence. They are assumed not to take a risky decision that can decrease their utility fun...
Article
Full-text available
A complex machine or machining line consists of a sequence of work positions through which products move one way in order to be processed. Designing such a production system represents a long-term decision problem involving different crucial decision stages. Combinatorial design is one of them; it mostly deals with assigning the set of indivisible...
Article
Rudek and Rudek [1] studied a single machine-scheduling problem to minimize the makespan, in which the processing time of each job depends on its position and an amount of a common non-renewable limited resource allocated to it. For this problem, the two effects are separated in the sense that an optimal decision with respect to the job positions c...
Article
Full-text available
A single-machine multi-product lot-sizing and sequencing problem is studied. In this problem, items of n different products are manufactured in lots. Demands for products as well as per item processing times are known. There are losses of productivity because of non perfect production. There is also a sequence dependent set-up time between lots of...
Article
Proofs of strong NP-hardness of single machine and two-machine flowshop scheduling problems with learning or aging effect given in Rudek (Computers & Industrial Engineering 61:20–31, 2011; Annals of Operations Research 196(1):491–516, 2012a; International Journal of Advanced Manufacturing Technology 59:299–309, 2012b; Applied Mathematics and Comput...
Article
Full-text available
For the single-item capacitated lot-sizing problem with linear costs and no backlogging, we suggest a straightforward O(n log n) time algorithm, which does not need a polymatroid or min-cost flow problem reformulation.
Article
Full-text available
Buffer capacity allocation problems for flow-line manufacturing systems with unreliable machines are studied. These problems arise in a wide range of manufacturing systems and concern determining buffer capacities with respect to a given optimality criterion which can depend on the average production rate of the line, buffer cost, inventory cost, e...
Data
Slides of the talk at the INCOM conference in Bucharest / Romania in May 2012
Article
Full-text available
A customer would like to buy a given set of products in a given set of Internet shops. For each Internet shop, standard prices for the products are known as well as a concave increasing discounting function of total standard and delivery price. The problem is to buy all the required products at the minimum total discounted price. Computational comp...
Article
We study problems of scheduling n jobs on m identical parallel machines, in which a common due window has to be assigned to all jobs. If a job is completed within the due window, then it incurs no scheduling cost. Otherwise, an earliness or tardiness cost is incurred. The job completion times as well as the due window location and size are integer...
Article
Full-text available
We study problems of scheduling n unit-time jobs on m identical parallel machines, in which a common due window has to be assigned to all jobs. If a job is completed within the due window, then no scheduling cost incurs. Otherwise, a job-dependent earliness or tardiness cost incurs. The job completion times, the due window location and the size are...
Article
Full-text available
A partition type optimisation problem (problem PT$_{\mbox{opt}}$) defined on partitions of a set is introduced. Its objective function is a composition of a number of auxiliary recursively computable functions. The conditions on the composition and the auxiliary functions sufficient for developing a Fully Polynomial Time Approximation Scheme (FPTA...
Article
Full-text available
This paper discusses several areas of research conducted by Vyacheslav Tanaev (1940–2002), mainly on scheduling. His contribution to the parametric decomposition of optimization problems is also addressed. For each area we focus on the most important results obtained by V.S. Tanaev and trace how his research has been advanced.