We consider some special cases of the NP-hard resource-constrained projectscheduling problem (RCPSP) to minimize the makespan. We show that a well-known lowerbounds for the problem may yield bad approximation ratios or its calculation is an NP-hardproblem too. We conjecture that the ratio of the optimal makespan of RCPSP to that of thepreemptive version of the problem is less than 2. We also provide some new estimates of theoptimal makespan of RCPSP.

For single and multi-machine scheduling problems with the criterion of minimizationmaximum lateness the metrics \rho has been used for the first time. A theorem of estimating theabsolute error has been proved. The idea of the offered approach consists in construction by aninitial instance of a problem of other instance for which it is possible to find the optimum orapproximated solution, with the minimal distance up to an initial instance in entered metric.

Исследована сравнительная выгодность основных социальных установок, к которым относятся коллективизм и эгоизм, в условиях демократического принятия коллективных решений.

We are given a set $N=\{1,\dots,n\}$ of $n$ jobs that must beprocessed on $m$ machines $M=\{1,\dots,m\}$. Preemption of thejobs is not allowed. Each machine can handle only one job at atime. For each job $j$ we have: $r_j$ -- release date $0\lep_{ji}\le +\infty$ -- processing time job $j$ on the machine $i$(if $p_{ji}=+\infty,$ then job $j$ can not process on the machine$i$) $d_j$ -- due date. Between jobs ratios of a precedence inthe form of an acyclic oriented graph $G \subset N \times N $ areset. Through $\pi_i$ we will definete the schedule of the jobsprocesseded on the machine $i, i=1,\dots,m$. Naturally, admissibleschedules without artificial idle times of the machines,satisfying the graph are considered only.

В докладе обсуждаются сетевые эффекты, связанные с функционированием инсти-туциональных фильтров. В качестве одного из примеров такого фильтра обсуждается проблема наивного инвестора.