The following pages link to Sergey Sevast'janov (Q1357728):
Displaying 41 items.
- Efficient approximation algorithms for the routing open shop problem (Q340238) (← links)
- (Q612213) (redirect page) (← links)
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays (Q612215) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- Tight complexity analysis of the relocation problem with arbitrary release dates (Q638514) (← links)
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
- (Q826116) (redirect page) (← links)
- (Q226491) (redirect page) (← links)
- (Q1377263) (redirect page) (← links)
- (Q340237) (redirect page) (← links)
- (Q628306) (redirect page) (← links)
- (Q1145848) (redirect page) (← links)
- (Q1337672) (redirect page) (← links)
- (Q226491) (redirect page) (← links)
- Seven problems: so different yet close (Q826117) (← links)
- The flow shop problem with no-idle constraints: a review and approximation (Q1027525) (← links)
- Value of the Steinitz constant (Q1145849) (← links)
- Nonstrict vector summation in multi-operation scheduling (Q1273125) (← links)
- Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
- On some geometric methods in scheduling theory: A survey (Q1337673) (← links)
- To the Steinitz lemma in coordinate form (Q1357729) (← links)
- Makespan minimization in preemptive two machine job shops (Q1377264) (← links)
- On-line and off-line approximation algorithms for vector covering problems (Q1386465) (← links)
- Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage (Q1607975) (← links)
- An introduction to multi-parameter complexity analysis of discrete problems (Q1772842) (← links)
- Vector summation within minimal angle (Q1803266) (← links)
- A polynomial-time open-shop problem with an arbitrary number of machines (Q1816373) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- When difference in machine loads leads to efficient scheduling in open shops (Q1960320) (← links)
- A note on the Coffman-Sethi bound for LPT scheduling (Q2356126) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- Open block scheduling in optical communication networks (Q2503353) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- Some positive news on the proportionate open shop problem (Q2633607) (← links)
- A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes (Q2663742) (← links)
- (Q2713932) (← links)
- (Q2729351) (← links)
- (Q2906542) (← links)
- (Q3115601) (← links)
- A scheme of approximation solution of problem 1 |r j|L max (Q3115616) (← links)
- (Q3115636) (← links)
- (Q3115718) (← links)
- (Q3206965) (← links)
- (Q3312008) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops (Q4835387) (← links)
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation (Q4849333) (← links)
