There is a demand for introducing a challenging and innovative R&D system to develop new technologies to generate weapon system requirements. Despite the increasing trend in annual core technology development tasks, the infrastructure expansion, including personnel in research management institutions, is relatively insufficient. This situation continuously exposes difficulties in task planning, selection, execution, and management. Therefore, there is a pressing need for strategies to initiate timely research and development and enhance budget execution efficiency through the streamlining of task agreement schedules. In this study, we propose a strategic model utilizing a flexible workforce model, considering constraints and optimizing workload distribution through resource allocation to minimize bottlenecks for efficient task agreement schedules. Comparative analysis with the existing operational environment confirms that the proposed model can handle an average of 67 more core technology development tasks within the agreement period compared to the baseline. In addition, the risk management analysis, which considered the probabilistic uncertainty of the fluctuating number of core technology research and development projects, confirmed that up to 115 core technology development can be contracted within the year under risk avoidance.

To make a satisfactory decision regarding project scheduling, a trade-off between the resource-related cost and project duration must be considered. A beneficial method for decision makers is to provide a number of alternative schedules of diverse project duration with minimum resource cost. In view of optimization, the alternative schedules are Pareto sets under multi-objective of project duration and resource cost. Assuming that resource cost is closely related to resource leveling, a heuristic algorithm for resource capacity reduction (HRCR) is developed in this study in order to generate the Pareto sets efficiently. The heuristic is based on the fact that resource leveling can be improved by systematically reducing the resource capacity. Once the reduced resource capacity is given, a schedule with minimum project duration can be obtained by solving a resource-constrained project scheduling problem. In HRCR, VNS (Variable Neighborhood Search) is implemented to solve the resource-constrained project scheduling problem. Extensive experiments to evaluate the HRCR performance are accomplished with standard benchmarking data sets, PSPLIB. Considering 5 resource leveling objective functions, it is shown that HRCR outperforms well-known multi-objective optimization algorithm, SPEA2 (Strength Pareto Evolutionary Algorithm-2), in generating dominant Pareto sets. The number of approximate Pareto optimal also can be extended by modifying weight parameter to reduce resource capacity in HRCR.

Previous researches have focused on the efficiency of project execution and the satisfaction of internal customers in view of the fact that a project is successful if any defects are not found in the short-term performance test of the project final outcom

This paper discusses a scheduling problem on object-oriented developments over multiple teams with limited resources in matrix organization. The objective of the problem is to minimize the makespan of overall projects. There are tangible and intangible advantages such as efficient resource share, improvement of productivity, development efforts and cost reduction, etc. by dispatching resources properly to the development teams. Traditionally, the project scheduling has been done with a manager's intuition or heuristic. We present a scheduling model with illustrative examples, stochastic search approach, and apply a variety of problems generated randomly to the approach. The results are analysed.