검색결과

검색조건
좁혀보기
검색필터
결과 내 재검색

간행물

    분야

      발행연도

      -

        검색결과 7

        1.
        2024.09 KCI 등재 구독 인증기관 무료, 개인회원 유료
        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.
        4,000원
        2.
        2020.06 KCI 등재 구독 인증기관 무료, 개인회원 유료
        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.
        4,000원
        3.
        2012.08 KCI 등재 구독 인증기관 무료, 개인회원 유료
        This paper shows scheduling methods to utilize heat pump systems as demand response resources in the smart grid environment. The heat pump system has a partial thermal storage tank which could be used at any time according to the consumer behavior based on the real time electricity tariff system. Some scheduling methods are proposed and an optimization basis is established considering areas, insulation conditions, heating set temperature, minimum heating maintaining period of thermal storage, maximum size of tank, etc.
        4,000원
        4.
        2005.03 KCI 등재 구독 인증기관 무료, 개인회원 유료
        This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and due dates. The proposed dispatching rules consider the information of total
        4,000원
        5.
        2004.10 구독 인증기관 무료, 개인회원 유료
        This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and duedates. The proposed dispatching rules consider the information of total work remaining and machine utilization to decrease mean flowtime and mean tardiness. The results of computer experiments show that those schedule performances are significantly improved by using the new dispatching rules. The results provide guidance for the researchers and practitioners of auxiliary resource constrained job shop scheduling to decrease mean flowtime and mean tardiness.
        4,000원