Rescheduling to minimize makespan on a changing number of identical processors

We consider the problem of rescheduling n jobs to minimize the makespan on m parallel identical processors when m changes value. We show this problem to be NP-hard in general. Call a list schedule totally optimal if it is optimal for all m = 1, …,n. When n is less than 6, there always exists a totally optimal schedule, but for n ≥ 6 this can fail. We show that an exact solution is less robust than the largest processing time first (LPT) heuristic and discuss implications for polynomial approximation schemes and hierarchical planning models.     

娱乐场所简易自动喷水灭火系统设计

歌舞娱乐放映游艺场所多设置在已建建筑内,往往不具备设置自动喷水灭火系统的条件。为此,笔者提出在这类建筑中设置简易自动喷水灭火系统的设想,给出了简易自动喷水灭火系统的组成、工作原理及特点,探讨了设计简易自动喷水灭火系统应注意的问题。     

Financial versus human resources in the Greek‐Turkish arms race: A forecasting investigation using artificial neural networks

This paper aims at forecasting the burden on the Greek economy resulting from the arms race against Turkey and at concentrating on the leading determinants of this burden. The military debt and the defence share of GDP are employed alternatively in order to approximate the measurement of the arms race pressure on Greece, and the method used is that of artificial neural networks. The use of a wide variety of explanatory variables in combination with the promising results derived, suggest that the impact on the Greek economy resulting from this arms race is determined, to a large, extent, by demographic factors which strongly favour the Turkish side. Prediction on both miltary debt and defence expenditure exhibited highly satisfactory accuracy, while the estimation of input significance, indicates that variables describing the Turkish side are often dominant over the corresponding Greek ones.