Person:228023: Difference between revisions

From MaRDI portal
Person:228023
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Mikhail Y. Kovalyov to Mikhail Y. Kovalyov: Duplicate
 
(No difference)

Latest revision as of 15:59, 9 December 2023

Available identifiers

zbMath Open kovalyov.mikhail-yakovlevichDBLP16/2654WikidataQ13031704 ScholiaQ13031704MaRDI QIDQ228023

List of research outcomes

PublicationDate of PublicationType
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty2024-04-02Paper
Fixed interval scheduling with third‐party machines2023-12-11Paper
Min‐sum controllable risk problems with concave risk functions of the same value range2023-12-11Paper
Integer knapsack problems with profit functions of the same value range2023-10-24Paper
Maximizing total early work in a distributed two‐machine flow‐shop2023-10-24Paper
Single machine scheduling with assignable due dates to minimize maximum and total late work2023-07-10Paper
Cost minimizing planning of container inspection and repair in multiple facilities2023-06-26Paper
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint2023-06-07Paper
A Computational Analysis Of Balanced Jit Optimization Algorithms2023-04-24Paper
Selecting a subset of diverse points based on the squared Euclidean distance2022-08-11Paper
Fleet and charging infrastructure decisions for fast-charging city electric bus service2022-03-09Paper
No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines2022-03-07Paper
Min-max controllable risk problems2021-07-14Paper
Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation2021-06-03Paper
Maximum diversity problem with squared Euclidean distance2020-05-19Paper
Lot-size scheduling of a single product on unrelated parallel machines2020-04-27Paper
Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity2020-01-22Paper
Bi-criteria path problem with minimum length and maximum survival probability2020-01-15Paper
Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\)2019-10-07Paper
Comments on ``Proportionate flowshops with general position dependent processing times and ``Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection2019-05-10Paper
Multiproduct batching and scheduling with buffered rework: The case of a car paint shop2019-05-02Paper
A parallel machine schedule updating game with compensations and clients averse to uncertain loss2018-12-17Paper
Minimizing the number of workers in a paced mixed-model assembly line2018-10-30Paper
An overview of revenue management and dynamic pricing models in hotel business2018-08-10Paper
Simple paths with exact and forbidden lengths2018-06-06Paper
A note on scheduling container storage operations of two non‐passing stacking cranes2018-04-27Paper
Optimal workforce assignment to operations of a paced assembly line2018-02-01Paper
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity2018-01-12Paper
Knapsack problem with objective value gaps2017-06-29Paper
Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem2017-06-13Paper
Graphs with maximal induced matchings of the same size2016-11-24Paper
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom2016-11-17Paper
Two faster algorithms for coordination of production and batch delivery: a note2016-07-06Paper
Batch scheduling with deadlines on parallel machines: an NP-hard case2016-05-26Paper
Two-agent scheduling with agent specific batches on an unbounded serial batching machine2015-11-12Paper
On a single machine-scheduling problem with separated position and resource effects2015-04-28Paper
Erratum to: ``Internet shopping with price-sensitive discounts2015-02-23Paper
Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence2015-01-22Paper
Internet shopping with price sensitive discounts2014-09-26Paper
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs2014-08-01Paper
Mathematical Caricature of Large Waves2014-03-21Paper
https://portal.mardi4nfdi.de/entity/Q28615682013-11-08Paper
Complexity of buffer capacity allocation problems for production lines with unreliable machines2013-09-26Paper
Strong NP-hardness of scheduling problems with learning or aging effect2013-09-03Paper
Soft due window assignment and scheduling of unit-time jobs on parallel machines2013-02-18Paper
Two-Agent Scheduling on an Unbounded Serial Batching Machine2012-11-02Paper
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence2012-07-12Paper
Scheduling a single server in a two-machine flow shop2012-06-04Paper
Multi-product lot-sizing and sequencing on a single imperfect machine2012-04-12Paper
Scheduling an unbounded batching machine with job processing time compatibilities2012-03-19Paper
Minimizing the number of late jobs on a single machine under due date uncertainty2012-01-16Paper
Batch Scheduling of Deteriorating Products2011-06-28Paper
An FPTAS for a supply scheduling problem with non-monotone cost functions2011-04-28Paper
The simplified partial digest problem: approximation and a graph-theoretic model2011-01-28Paper
Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary2011-01-03Paper
A generic approach to proving NP-hardness of partition type problems2010-11-25Paper
https://portal.mardi4nfdi.de/entity/Q31612872010-10-14Paper
Internet shopping optimization problem2010-09-02Paper
On the approximability of the simplified partial digest problem2010-04-28Paper
Lot-Sizing and Sequencing on a Single Imperfect Machine2009-05-13Paper
Approximate solution of the control problem of supplies with many intervals and concave cost functions2009-05-07Paper
https://portal.mardi4nfdi.de/entity/Q53017342009-01-20Paper
Scheduling jobs in a contaminated area: a model and heuristic algorithms2008-08-14Paper
A single-item economic lot-sizing problem with a non-uniform resource: Approximation2008-04-24Paper
Batch scheduling of deteriorating reworkables2008-04-24Paper
Optimal testing and repairing a failed series system2007-06-21Paper
Batching deteriorating items with applications in computer communication and reverse logistics2007-06-13Paper
https://portal.mardi4nfdi.de/entity/Q34173752007-01-29Paper
Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy2006-12-07Paper
Scheduling with controllable release dates and processing times: Makespan minimization2006-10-27Paper
Scheduling with controllable release dates and processing times: total completion time minimization2006-10-27Paper
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure2006-06-14Paper
Scheduling in a contaminated area: a model and polynomial algorithms2006-05-29Paper
Batching work and rework processes with limited deterioration of reworkables2006-01-10Paper
Batch scheduling with controllable setup and processing times to minimize total completion time2005-06-21Paper
Positive half-products and scheduling with controllable processing times2005-04-21Paper
Single machine group scheduling with resource dependent setup and processing times2005-02-09Paper
Batching decisions for assembly production systems2005-01-12Paper
Maximization problems in single machine scheduling2004-08-10Paper
Scheduling malleable tasks on parallel processors to minimize the makespan2004-08-10Paper
Scheduling jobs with piecewise linear decreasing processing times2004-03-15Paper
Single machine batch scheduling with jointly compressible setup and processing times.2004-01-05Paper
An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note2003-04-02Paper
The complexity of two group scheduling problems2003-02-23Paper
A polynomial algorithm for lot-size scheduling of two type tasks.2003-01-21Paper
Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness2002-12-15Paper
Minimizing the total weighted completion time of deteriorating jobs2002-07-14Paper
Fast fully polynomial approximation schemes for minimizing completion time variance2002-06-16Paper
Single supplier scheduling for multiple deliveries2002-06-09Paper
Parallel machine batching and scheduling with deadlines2001-12-05Paper
https://portal.mardi4nfdi.de/entity/Q27123702001-05-06Paper
A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem2001-02-27Paper
Scheduling with batching: A review2001-01-30Paper
Single machine batch scheduling with resource dependent setup and processing times2001-01-01Paper
Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness1999-11-29Paper
https://portal.mardi4nfdi.de/entity/Q42464961999-08-08Paper
Batch scheduling with deadlines on parallel machines1999-03-07Paper
Single machine scheduling with batch deliveries1999-02-22Paper
Single machine scheduling subject to deadlines and resource dependent processing times1999-02-22Paper
Scheduling a batching machine1999-01-11Paper
A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs1999-01-05Paper
Batch scheduling and common due date assignment problem: An NP-hard case1998-08-19Paper
Uniform machine scheduling of unit-time jobs subject to resource constraints1998-07-28Paper
A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)1998-07-06Paper
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times1998-05-12Paper
https://portal.mardi4nfdi.de/entity/Q31234171997-07-06Paper
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties1997-06-12Paper
Batch scheduling and common due-date assignment on a single machine1997-01-06Paper
Single machine batch scheduling with deadlines and resource dependent processing times1996-10-20Paper
Single Machine Group Scheduling with Two Ordered Criteria1996-09-26Paper
https://portal.mardi4nfdi.de/entity/Q48732421996-04-16Paper
Improving the complexities of approximation algorithms for optimization problems1996-01-07Paper
https://portal.mardi4nfdi.de/entity/Q48410431995-11-30Paper
https://portal.mardi4nfdi.de/entity/Q48417601995-08-27Paper
Single machine group scheduling with ordered criteria1995-08-27Paper
A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work1994-11-17Paper
https://portal.mardi4nfdi.de/entity/Q42930251994-05-18Paper
https://portal.mardi4nfdi.de/entity/Q42465561993-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40123421992-09-27Paper
Minimization of the weighted sum of overdue customers in a single-server system1992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q39730851992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q33624791991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30335471990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34775681990-01-01Paper
Approximation scheduling algorithms: a survey1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37830651988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38015791988-01-01Paper
The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36865121985-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Mikhail Y. Kovalyov