This paper proposes an optimization system for solving an NP-hard problem by using several new algorithms and application programs. This study aims to identify a suitable distribution of investment projects across several developed industrial regions. It is assumed that all industrial regions involved have the same economic and strategic characteristics. The problem involves a set of projects that are to be assigned across regions. Each project creates an estimated number of new jobs, and the distribution of projects can be guided by minimizing the maximum total number of newly created jobs. The problem is NP-hard one, and it is difficult to determine the most appropriate distribution. We apply scheduling algorithms in order to solve the analyzed problem. Severalheuristics are developedto obtain the appropriate distribution of newly created jobs across all regions. A branch-and-bound method is employed in order to obtain the exact solution. The performance of the algorithm is demonstrated by the experimental results for a total number of 1850 instances.

中文翻译：

---

区域投资项目分配的算法。

本文提出了一种通过使用几种新算法和应用程序来解决NP难题的优化系统。本研究旨在确定在多个发达工业区中合适的投资项目分布。假定所有涉及的工业区都具有相同的经济和战略特征。该问题涉及要跨地区分配的一组项目。每个项目都会创造一个估计数量的新工作，并且可以通过最大程度减少新创造的工作总数来指导项目的分布。这个问题是NP难题，很难确定最合适的分布。我们应用调度算法来解决所分析的问题。开发了几种启发式方法，以在所有地区中适当分配新创造的工作。为了获得精确的解，采用了分支定界法。总共1850个实例的实验结果证明了该算法的性能。