Alexander V. Kononov

Vladimir V. Mazalov

Optim. Lett., 2022

Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion.

[BibT_eX]

[DOI]

Yulia V. Zakharova

J. Glob. Optim., 2022

On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements.

[BibT_eX]

[DOI]

Julia Memar

J. Glob. Optim., 2022

Cost-aware scheduling on uniform parallel machines.

[BibT_eX]

[DOI]

Irina N. Lushchakova

Comput. Ind. Eng., 2022

Scheduling with Untrusted Predictions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Two-machine flow shop with dynamic storage space.

[BibT_eX]

[DOI]

Joanna Berlinska

Optim. Lett., 2021

A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements.

[BibT_eX]

[DOI]

Alexandr V. Kononov

Joey Fung

J. Comb. Optim., 2021

Speed Scaling with Explorable Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

Algorithms for Flow Shop with Job-Dependent Buffer Requirements.

[BibT_eX]

[DOI]

Julia Memar

Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2021

2020

Approximation algorithms for energy-efficient scheduling of parallel jobs.

[BibT_eX]

[DOI]

J. Sched., 2020

Preface.

[BibT_eX]

[DOI]

Alexander S. Strekalovsky

Mikhail Posypkin

Artem V. Pyatkin

J. Glob. Optim., 2020

Branch-and-bound approach for optima localization in scheduling multiprocessor jobs.

[BibT_eX]

[DOI]

Polina A. Kononova

Alexander Gordeev

Int. Trans. Oper. Res., 2020

LP-Based Algorithms for Multistage Minimization Problems.

[BibT_eX]

[DOI]

Bruno Escoffier

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

Makespan Minimization for Parallel Jobs with Energy Constraint.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes.

[BibT_eX]

[DOI]

Ilya Chernykh

Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

Scheduling Malleable Jobs Under Topological Constraints.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

2019

Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax.

[BibT_eX]

[DOI]

Mikhail Y. Kovalyov

Theor. Comput. Sci., 2019

Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations.

[BibT_eX]

[DOI]

Joanna Berlinska

Proceedings of the Optimization of Complex Systems: Theory, 2019

Flow Shop with Job-Dependent Buffer Requirements - a Polynomial-Time Algorithm and Efficient Heuristics.

[BibT_eX]

[DOI]

Julia Memar

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem.

[BibT_eX]

[DOI]

Yousef M. Alhamdan

Proceedings of the Computer Science - Theory and Applications, 2019

2018

Energy-efficient scheduling and routing via randomized rounding.

[BibT_eX]

[DOI]

J. Sched., 2018

Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems.

[BibT_eX]

[DOI]

CoRR, 2018

Scheduling under Uncertainty: A Query-based Approach.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

An Approximation Algorithm for Preemptive Speed Scaling Scheduling of Parallel Jobs with Migration.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

2016

Relocation scheduling subject to fixed processing sequences.

[BibT_eX]

[DOI]

F. J. Hwang

J. Sched., 2016

A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job.

[BibT_eX]

[DOI]

Aldar Dugarzhapov

J. Sched., 2016

Clustering on k-edge-colored graphs.

[BibT_eX]

[DOI]

Emmanouil Pountourakis

Vassilis Zissimopoulos

Discret. Appl. Math., 2016

Scheduling of Two Parallel Machines with Linear Decreasing Time Slot Costs to Minimize Total Weighted Completion Time.

[BibT_eX]

[DOI]

Irina N. Lushchakova

Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

On Speed Scaling Scheduling of Parallel Jobs with Preemption.

[BibT_eX]

[DOI]

Proceedings of the Discrete Optimization and Operations Research, 2016

Short Survey on Graph Correlation Clustering with Minimization Criteria.

[BibT_eX]

[DOI]

Victor P. Il'ev

Svetlana Il'eva

Proceedings of the Discrete Optimization and Operations Research, 2016

Optima Localization in Scheduling Multi-Processor Jobs.

[BibT_eX]

[DOI]

Alexander Gordeev

Polina A. Kononova

2015

O(log m)-approximation for the routing open shop problem.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2015

Single-machine scheduling with supporting tasks.

[BibT_eX]

[DOI]

Kuei-Tang Fang

Discret. Optim., 2015

From preemptive to non-preemptive speed-scaling scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Min-Power Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Bounded max-colorings of graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Isomorphic scheduling problems.

[BibT_eX]

[DOI]

Stanislaw Gawiejnowicz

Ann. Oper. Res., 2014

Improved Approximations for the Max k-Colored Clustering Problem.

[BibT_eX]

[DOI]

Alexander A. Ageev

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2013

Efficient approximation algorithms for the routing open shop problem.

[BibT_eX]

[DOI]

Ilya Chernykh

Comput. Oper. Res., 2013

2012

A Complete 4-parametric complexity classification of short shop scheduling problems.

[BibT_eX]

[DOI]

Maxim Sviridenko

J. Sched., 2012

Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications.

[BibT_eX]

[DOI]

J. Sched., 2012

Integer preemptive scheduling on parallel machines.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2012

2011

Properties of optimal schedules in preemptive shop scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Minimizing the total weighted completion time in the relocation problem.

[BibT_eX]

[DOI]

J. Sched., 2010

Complexity and approximability of scheduling resumable proportionally deteriorating jobs.

[BibT_eX]

[DOI]

Stanislaw Gawiejnowicz

Eur. J. Oper. Res., 2010

2009

The Routing Open Shop Problem: New Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Complete Complexity Classification of Short Shop Scheduling.

[BibT_eX]

[DOI]

Maxim Sviridenko

Proceedings of the Computer Science, 2009

Integrality Property in Preemptive Parallel Machine Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2009

2007

Customer order scheduling to minimize the number of late jobs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

Approximation Algorithms for the Black and White Traveling Salesman Problem.

[BibT_eX]

[DOI]

Binay K. Bhattacharya

Yuzhuang Hu

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Open block scheduling in optical communication networks.

[BibT_eX]

[DOI]

Alexander A. Ageev

Aleksei V. Fishkin

Sergey V. Sevastianov

Theor. Comput. Sci., 2006

On relocation problems with multiple identical working crews.

[BibT_eX]

[DOI]

Discret. Optim., 2006

Approximation Algorithms for Scheduling Problems with Exact Delays.

[BibT_eX]

[DOI]

Alexander A. Ageev

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

2005

Bicriteria approximation algorithms for scheduling problems with communications delays.

[BibT_eX]

[DOI]

J. Sched., 2005

2004

Scheduling Tasks with Small Communication Delays for Clusters of Processors.

[BibT_eX]

[DOI]

Rodolphe Giroudeau

Ann. Oper. Res., 2004

2003

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.

[BibT_eX]

[DOI]

Eric Angel

Theor. Comput. Sci., 2003

Bicriteria approximation algorithms for scheduling problems with communications.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002

A linear time approximation scheme for makespan minimization in an open shop with release dates.

[BibT_eX]

[DOI]

Maxim Sviridenko

Oper. Res. Lett., 2002

2001

NP-hard cases in scheduling deteriorating jobs on dedicated machines.

[BibT_eX]

[DOI]

Stanislaw Gawiejnowicz

J. Oper. Res. Soc., 2001

On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements.

[BibT_eX]

[DOI]

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.

[BibT_eX]

[DOI]

Eric Angel

Proceedings of the Algorithms, 2001

1999

When difference in machine loads leadsto efficient scheduling in open shops.

[BibT_eX]

[DOI]