The following pages link to Alexander A. Lazarev (Q483268):
Displaying 50 items.
- (Q329084) (redirect page) (← links)
- Minimization of the maximal lateness for a single machine (Q329086) (← links)
- Single machine total tardiness maximization problems: complexity and algorithms (Q367638) (← links)
- A graphical approach to solve an investment optimization problem (Q483269) (← links)
- Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine (Q492474) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- Minimizing the maximal weighted lateness of delivering orders between two railroad stations (Q517328) (← links)
- Two-directional traffic scheduling problem solution for a single-track railway with siding (Q517332) (← links)
- Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491) (← links)
- Metrics in scheduling problems (Q610604) (← links)
- Foreword to the thematical issue devoted to the seventieth anniversary of Academician V. S. Tanaev (Q612200) (← links)
- Algorithms for some maximization scheduling problems on a single machine (Q612210) (← links)
- Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine (Q612212) (← links)
- Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (Q732689) (← links)
- Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine (Q827995) (← links)
- Rescheduling traffic on a partially blocked segment of railway with a siding (Q828064) (← links)
- A hybrid algorithm for the single-machine total tardiness problem (Q954025) (← links)
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems (Q980008) (← links)
- On project scheduling problem (Q1003084) (← links)
- Dual of the maximum cost minimization problem (Q1116884) (← links)
- Scheduling algorithms based on necessary optimality conditions (Q1116885) (← links)
- Analysis of scheduling problems using transformations (Q1119168) (← links)
- Scheduling the two-way traffic on a single-track railway with a siding (Q1647296) (← links)
- Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem (Q1673705) (← links)
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
- Transformation of the network graph of scheduling problems with precedence constraints to a planar graph (Q1760920) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)
- A special case of the single-machine total tardiness problem is NP-hard (Q1946412) (← links)
- A note on the paper `Single machine scheduling problems with financial resource constraints: some complexity results and properties' by E.R. Gafarov et al. (Q1950246) (← links)
- Decomposition algorithm to minimize total tardiness (Q1951233) (← links)
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine (Q1951910) (← links)
- A problem of scheduling operations at a locomotive maintenance depot (Q1982909) (← links)
- Minimization of the weighted total sparsity of cosmonaut training courses (Q2026164) (← links)
- Metric approach for finding approximate solutions of scheduling problems (Q2048806) (← links)
- Metric interpolation for the problem of minimizing the maximum lateness for a single machine (Q2069682) (← links)
- Optimization of a recursive conveyor by reduction to a constraint satisfaction problem (Q2069702) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- Evaluating typical algorithms of combinatorial optimization to solve continuous-time based scheduling problem (Q2331454) (← links)
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139) (← links)
- A metric for total tardiness minimization (Q2362385) (← links)
- Graphical approach to combinatorial optimization (Q2371616) (← links)
- Estimation of absolute error in scheduling problems of minimizing the maximum lateness (Q2377526) (← links)
- The problem of trains formation and scheduling: integer statements (Q2441252) (← links)
- A scheme of approximation solution of problem 1 |r j|L max (Q3115616) (← links)
- (Q3652469) (← links)
- (Q3735431) (← links)
- (Q3735432) (← links)
- (Q3735495) (← links)
