Vyacheslav Tanaev: contributions to scheduling and related areas

DOI10.1007/s10951-011-0230-4zbMath1280.90048OpenAlexW2032104585WikidataQ58616791 ScholiaQ58616791MaRDI QIDQ2434293

Yanyan Li

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-011-0230-4

zbMATH Keywords

schedulingsymmetric functionpermutationsequencingmixed graphparametric decompositionpriority-generating function

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Biographies, obituaries, personalia, bibliographies (01A70)

Cites Work

• Complexity results for flow-shop and open-shop scheduling problems with transportation delays
• Open shop unit-time scheduling problems with symmetric objective functions
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• A decomposition method for transfer line life cycle cost optimisation
• Coloring some classes of mixed graphs
• Using mixed graph coloring to minimize total completion time in job shop scheduling
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Sequencing and scheduling in robotic cells: recent developments
• Parametric shortest path algorithms with an application to cyclic staffing
• Stability of an optimal schedule
• New scaling algorithms for the assignment and minimum mean cycle problems
• A characterization of the minimum cycle mean in a digraph
• On the calculation of the stability radius of an optimal or an approximate schedule
• Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
• Shop scheduling problems under precedence constraints
• Mixed graph colorings
• Uniform machine scheduling of unit-time jobs subject to resource constraints
• Flow shop scheduling problems under machine-dependent precedence constraints
• Some concepts of stability analysis in combinatorial optimization
• NP-hardness of shop-scheduling problems with three jobs
• Routing problems: A bibliography
• On two coloring problems in mixed graphs
• A heuristic multi-start decomposition approach for optimal design of serial machining lines
• Scheduling in a contaminated area: a model and polynomial algorithms
• Single machine scheduling and due date assignment under series-parallel precedence constraints
• Optimal scheduling for two-processor systems
• A decomposition theorem for partially ordered sets
• Scheduling with Deadlines and Loss Functions
• Optimal two- and three-stage production schedules with setup times included
• Scheduling Problems and Mixed Graph Colorings
• Decomposition Principle for Linear Programs
• The period routing problem
• Fifty years of scheduling: a survey of milestones
• Interval scheduling: A survey
• Optimization of power transmission systems using a multi-level decomposition approach
• Sequencing with Series-Parallel Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Approximation scheduling algorithms: a survey
• Heuristics for generalized shop scheduling problems based on decomposition
• The open shop scheduling problem with a given sequence of jobs on one machine
• Mixed multigraph approach to scheduling jobs on machines of different types^∗
• Some simple scheduling algorithms
• Stability and Regularization of Vector Problems of Integer Linear Programming
• Adaptive scheduling algorithm based on mixed graph model
• Two-Level Planning
• Balancing large-scale machining lines with multi-spindle heads using decomposition
• Combinatorial optimization with rational objective functions
• Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
• Faster parametric shortest path and minimum‐balance algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vyacheslav Tanaev: contributions to scheduling and related areas