Natalia V. Shakhlevich

Available identifiers

zbMath Open shakhlevich.natalia-vMaRDI QIDQ321100

List of research outcomes

Publication	Date of Publication	Type
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques	2024-03-15	Paper
Scheduling divisible loads with time and cost constraints	2022-01-14	Paper
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints	2020-11-09	Paper
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost	2020-04-21	Paper
Models and algorithms for energy-efficient scheduling with immediate start of jobs	2019-08-08	Paper
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches	2018-05-30	Paper
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines	2018-02-28	Paper
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization	2018-02-13	Paper
Tabu search and lower bounds for a combined production-transportation problem	2016-11-14	Paper
Complexity results for storage loading problems with stacking constraints	2016-10-07	Paper
Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines	2016-05-19	Paper
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times	2015-10-19	Paper
Minimising the number of gap-zeros in binary matrices	2015-07-28	Paper
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines	2013-06-27	Paper
Scheduling coupled-operation jobs with exact time-lags	2012-10-19	Paper
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations	2012-01-16	Paper
Inverse scheduling: Two-machine flow-shop problem	2011-10-18	Paper
Parallel batch scheduling of equal-length jobs with release and due dates	2010-11-03	Paper
Inverse scheduling with maximum lateness objective	2009-12-02	Paper
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION	2009-06-23	Paper
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach	2008-11-25	Paper
Preemptive scheduling on uniform parallel machines with controllable job processing times	2008-07-01	Paper
Two-machine open shop problem with controllable processing times	2008-01-18	Paper
Pre-emptive scheduling problems with controllable processing times	2007-05-15	Paper
Single machine scheduling with controllable release and processing parameters	2006-10-30	Paper
Scheduling with controllable release dates and processing times: Makespan minimization	2006-10-27	Paper
Scheduling with controllable release dates and processing times: total completion time minimization	2006-10-27	Paper
Open shop unit-time scheduling problems with symmetric objective functions	2006-03-09	Paper
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem	2005-04-21	Paper
Three-machine shop scheduling with partially ordered processing routes	2005-03-14	Paper
Complexity results for flow-shop and open-shop scheduling problems with transportation delays	2004-08-10	Paper
Single machine scheduling of unit-time jobs with controllable release dates	2003-09-15	Paper
Common due date assignment and scheduling with ready times	2003-04-02	Paper
Proportionate flow shop with controllable processing times	2000-04-03	Paper
Complexity of mixed shop scheduling problems: A survey	2000-03-19	Paper
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs	2000-01-11	Paper
Minimizing total weighted completion time in a proportionate flow shop	1999-01-11	Paper
On the solution region for certain scheduling problems with preemption	1998-12-06	Paper
Adaptive scheduling algorithm based on mixed graph model	1996-11-25	Paper
NP-hardness of shop-scheduling problems with three jobs	1996-05-13	Paper
A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs	1996-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q4840995	1996-01-08	Paper
Scheduling two jobs with fixed and nonfixed routes	1995-03-15	Paper
Optimal job-shop scheduling with two jobs in systems with unrestricted paths	1994-07-06	Paper
Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function	1993-12-20	Paper
https://portal.mardi4nfdi.de/entity/Q4012340	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4006771	1992-09-26	Paper
https://portal.mardi4nfdi.de/entity/Q3483071	1990-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Natalia V. Shakhlevich