Yuri N. Sotskov

From MaRDI portal
Revision as of 12:56, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:367242

Available identifiers

zbMath Open sotskov.yuri-nMaRDI QIDQ367242

List of research outcomes

PublicationDate of PublicationType
A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring2023-09-13Paper
Optimality region for job permutation in single-machine scheduling with uncertain processing times2021-01-14Paper
Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines2020-01-27Paper
Single machine scheduling problem with interval processing times and total completion time objective2020-01-13Paper
The stability radius of an optimal line balance with maximum efficiency for a simple assembly line2018-12-18Paper
A neural network algorithm for servicing jobs with sequential and parallel machines2015-11-23Paper
Stability polyhedra of optimal permutation of jobs servicing2015-11-23Paper
Scheduling personal finances via integer programming2013-09-26Paper
Measures of problem uncertainty for scheduling with interval processing times2013-08-07Paper
Minimizing total weighted flow time under uncertainty using dominance and a stability box2012-11-15Paper
The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times2012-01-18Paper
Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary2011-01-03Paper
Minimizing total weighted completion time with uncertain data: a stability approach2011-01-03Paper
Minimizing total weighted flow time of a set of jobs with interval processing times2010-05-08Paper
Schedule execution for two-machine flow-shop with interval processing times2009-07-20Paper
https://portal.mardi4nfdi.de/entity/Q35988782009-02-03Paper
Complexity of shop-scheduling problems with fixed number of jobs: a survey2007-11-14Paper
Using mixed graph coloring to minimize total completion time in job shop scheduling2007-01-11Paper
Optimality of Jackson's permutations with respect to limited machine availability2006-09-14Paper
Stability analysis of an optimal balance for an assembly line with fixed cycle time2005-10-17Paper
https://portal.mardi4nfdi.de/entity/Q46674152005-04-19Paper
Flowshop scheduling problem to minimize total completion time with random and bounded processing times2005-04-04Paper
Sequencing with uncertain numerical data for makespan minimisation2005-01-13Paper
Mean flow time minimization with given bounds of processing times2004-11-22Paper
Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times2003-12-03Paper
Two-machine flowshop minimum-length scheduling problem with random and bounded processing times2003-06-23Paper
Scheduling Problems and Mixed Graph Colorings2002-11-28Paper
Heuristics for hybrid flow shops with controllable processing times and assignable due dates2002-07-11Paper
https://portal.mardi4nfdi.de/entity/Q27841752002-04-17Paper
Stability of Johnson's schedule with respect to limited machine availability2002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27123732001-05-06Paper
https://portal.mardi4nfdi.de/entity/Q47899172001-01-01Paper
On the application of insertion techniques for job shop problems with setup times2000-08-24Paper
https://portal.mardi4nfdi.de/entity/Q42470592000-05-25Paper
Complexity of mixed shop scheduling problems: A survey2000-03-19Paper
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs2000-01-11Paper
Heuristics for generalized shop scheduling problems based on decomposition1999-09-09Paper
Preemptive job-shop scheduling problems with a fixed number of jobs1999-09-07Paper
https://portal.mardi4nfdi.de/entity/Q42465251999-06-01Paper
On the calculation of the stability radius of an optimal or an approximate schedule1998-12-06Paper
Optimal makespan scheduling with given bounds of processing times1998-09-07Paper
Mixed multigraph approach to scheduling jobs on machines of different types1998-02-05Paper
On the complexity of two machine job-shop scheduling with regular objective functions1997-12-04Paper
Stability of a schedule minimizing mean flow time1997-08-03Paper
Adaptive scheduling algorithm based on mixed graph model1996-11-25Paper
Heuristics for permutation flow shop scheduling with batch setup times1996-10-31Paper
https://portal.mardi4nfdi.de/entity/Q48829971996-07-01Paper
NP-hardness of shop-scheduling problems with three jobs1996-05-13Paper
A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs1996-04-29Paper
https://portal.mardi4nfdi.de/entity/Q48409951996-01-08Paper
https://portal.mardi4nfdi.de/entity/Q48410081995-09-27Paper
https://portal.mardi4nfdi.de/entity/Q48415791995-08-08Paper
Optimal schedules with infinitely large stability radius1995-06-21Paper
https://portal.mardi4nfdi.de/entity/Q48363081995-06-14Paper
Some concepts of stability analysis in combinatorial optimization1995-05-17Paper
Scheduling two jobs with fixed and nonfixed routes1995-03-15Paper
The stability of the approximate Boolean minimization of a linear form1994-07-06Paper
Complexity of optimal scheduling problems with three jobs1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40123401992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40123411992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40067711992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q39946871992-09-17Paper
Stability of an optimal schedule1992-06-28Paper
The complexity of shop-scheduling problems with two or three jobs1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q34775681990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34830711990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33599821989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33620811989-01-01Paper
The stability of high-speed optimal schedules1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38240931989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42052301989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47322981989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38078671988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38354771988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37655441985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37121391982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39330071981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38792821980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38907381980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39521201980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39521211980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41245891977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41205931976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41233531976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47669941974-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: Yuri N. Sotskov