The following pages link to V. A. Strusevich (Q217074):
Displaying 50 items.
- (Q177701) (redirect page) (← links)
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
- (Q512802) (redirect page) (← links)
- Scheduling with time-changing effects and rate-modifying activities (Q512804) (← links)
- Scheduling three-operation jobs in a two-machine flow shop to minimize makespan (Q596459) (← links)
- Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary (Q612205) (← links)
- Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
- Batching decisions for assembly production systems (Q703918) (← links)
- Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
- Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
- Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
- Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← links)
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- Single machine scheduling and due date assignment with positionally dependent processing times (Q1027580) (← links)
- Operator non-availability periods (Q1041405) (← links)
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
- Scheduling incompatible tasks on two machines (Q1042485) (← links)
- (Q1175305) (redirect page) (← links)
- Single and multiple period layout models for automated manufacturing systems (Q1175306) (← links)
- A greedy open shop heuristic with job priorities (Q1273127) (← links)
- A heuristic algorithm for two-machine re-entrant shop scheduling (Q1290158) (← links)
- Approximation algorithms for two-machine flow shop scheduling with batch setup times (Q1290646) (← links)
- A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581) (← links)
- Heuristics for short route job shop scheduling problems (Q1298692) (← links)
- Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment (Q1302578) (← links)
- Worst-case analysis of heuristics for open shops with parallel machines (Q1310023) (← links)
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function (Q1310024) (← links)
- Optimal job-shop scheduling with two jobs in systems with unrestricted paths (Q1323959) (← links)
- List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Shop scheduling problems under precedence constraints (Q1357789) (← links)
- An open shop scheduling problem with a non-bottleneck machine (Q1371949) (← links)
- Two-stage no-wait scheduling models with setup and removal times separated (Q1374028) (← links)
- Non-preemptive two-machine open shop scheduling with non-availability constraints (Q1395372) (← links)
- Estimating output-specific efficiencies (Q1396173) (← links)
- Scheduling problems for parallel dedicated machines under multiple resource constraints. (Q1417559) (← links)
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine (Q1569925) (← links)
- Group technology approach to the open shop scheduling problem with batch setup times (Q1577474) (← links)
- Constraint propagation in flexible manufacturing (Q1582801) (← links)
- Two-stage open shop scheduling with a bottleneck machine (Q1592745) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- The block retrieval problem (Q1681149) (← links)
- Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
