N. V. Shakhlevich

From MaRDI portal
Person:321100

Available identifiers

zbMath Open shakhlevich.natalia-vMaRDI QIDQ321100

List of research outcomes





PublicationDate of PublicationType
Preemptive scheduling of parallel jobs of two sizes with controllable processing times2024-05-30Paper
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques2024-03-15Paper
Scheduling divisible loads with time and cost constraints2022-01-14Paper
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints2020-11-09Paper
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost2020-04-21Paper
Models and algorithms for energy-efficient scheduling with immediate start of jobs2019-08-08Paper
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches2018-05-30Paper
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines2018-02-28Paper
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization2018-02-13Paper
Tabu search and lower bounds for a combined production-transportation problem2016-11-14Paper
The assignment problem with nearly Monge arrays and incompatible partner indices2016-11-02Paper
Complexity results for storage loading problems with stacking constraints2016-10-07Paper
Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines2016-05-19Paper
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times2015-10-19Paper
Minimising the number of gap-zeros in binary matrices2015-07-28Paper
A note on reverse scheduling with maximum lateness objective2014-08-18Paper
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines2013-06-27Paper
Scheduling coupled-operation jobs with exact time-lags2012-10-19Paper
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations2012-01-16Paper
Inverse scheduling: Two-machine flow-shop problem2011-10-18Paper
Parallel batch scheduling of equal-length jobs with release and due dates2010-11-03Paper
Inverse scheduling with maximum lateness objective2009-12-02Paper
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION2009-06-23Paper
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach2008-11-25Paper
Preemptive scheduling on uniform parallel machines with controllable job processing times2008-07-01Paper
Two-machine open shop problem with controllable processing times2008-01-18Paper
Pre-emptive scheduling problems with controllable processing times2007-05-15Paper
Single machine scheduling with controllable release and processing parameters2006-10-30Paper
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
Open shop unit-time scheduling problems with symmetric objective functions2006-03-09Paper
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem2005-04-21Paper
Three-machine shop scheduling with partially ordered processing routes2005-03-14Paper
Complexity results for flow-shop and open-shop scheduling problems with transportation delays2004-08-10Paper
Single machine scheduling of unit-time jobs with controllable release dates2003-09-15Paper
Common due date assignment and scheduling with ready times2003-04-02Paper
Proportionate flow shop with controllable processing times2000-04-03Paper
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
Minimizing total weighted completion time in a proportionate flow shop1999-01-11Paper
On the solution region for certain scheduling problems with preemption1998-12-06Paper
Adaptive scheduling algorithm based on mixed graph model1996-11-25Paper
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
Scheduling two jobs with fixed and nonfixed routes1995-03-15Paper
Optimal job-shop scheduling with two jobs in systems with unrestricted paths1994-07-06Paper
Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function1993-12-20Paper
https://portal.mardi4nfdi.de/entity/Q40123401992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40067711992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q34830711990-01-01Paper

Research outcomes over time

This page was built for person: N. V. Shakhlevich