#### Filter Results:

- Full text PDF available (21)

#### Publication Year

2002

2018

- This year (2)
- Last 5 years (13)
- Last 10 years (41)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- I G Shemiakin, Valentina Stepanshina, +7 authors T I Tarasova
- Zhurnal mikrobiologii, epidemiologii, iâ€¦
- 2002

A total of 122 M. tuberculosis clinical drug-resistant strains isolated in Central Russia were studied by spoligotyping and genome fingerprinting techniques. According to spoligotyping results 77% ofâ€¦ (More)

- Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner
- Annals OR
- 2012

We consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed. We present aâ€¦ (More)

- T. C. Edwin Cheng, Alexander A. Lazarev, Evgeny R. Gafarov
- Computers & OR
- 2009

We propose a hybrid algorithm based on the Ant Colony Optimization (ACO) meta-heuristic, in conjunction with four well-known elimination rules, to tackle the NP -hard single-machine schedulingâ€¦ (More)

- Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner
- Annals OR
- 2014

In this paper, we consider the well-known resource-constrained project scheduling problem. We give some arguments that already a special case of this problem with a single type of resources is notâ€¦ (More)

We consider a variant of the freight railcar flow problem. In this problem, we need 1) to choose a set of transportation demands between stations in a railroad network, and 2) to fulfill theseâ€¦ (More)

We consider the problem 1 | rj | Lmax. A set N = {1, . . . , n} of jobs has to be scheduled on a single machine. Each job j âˆˆ N has a processing time pj , a release date rj and a due date dj .â€¦ (More)

- Alexander A. Lazarev, Ivan Nekrasov, Nikolay Pravdivets
- Algorithms
- 2018

We consider one approach to formalize the Resource-Constrained Project Scheduling Problem (RCPSP) in terms of combinatorial optimization theory. The transformation of the original problem intoâ€¦ (More)

- Alexander A. Lazarev, Dmitry I. Arkhipov, Frank Werner
- Optimization Letters
- 2017

The following special case of the classical NP-hard scheduling problem 1|r j |Lmax is considered. There is a set of jobs N = {1, 2, . . . , n} with identical processing times p j = p for all jobs j âˆˆâ€¦ (More)

The scheduling problem of minimizing total tardiness on a single machine is known to be NP -hard in the ordinary sense. In this paper, we consider the special case of the problem when the processingâ€¦ (More)

In this paper, we consider single machine scheduling problems with a non-renewable resource. This type of problems has not been intensively investigated in the literature so far. For several problemsâ€¦ (More)