• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.171-192
• /
• 1993

In this paper, a rule for dispatching operations, named the Most Dissimilar Resources (MDR) dispatching rule is presented. The MDR dispatching rule has been designed to maximize utilization of resources in a resource-constrained job shop with general precedence constraints. In shown that solving the above scheduling problem with the MDR dispatching rule is equivalent to multiple solving of the maximum clique problem. A graph theoretic approach is used to model the latter problem. The pairwise counting heuristic of computational time complexity O(n$^{2}$) is developed to solve the maximum clique problem. An attempt is made to combine the MDR dispatching rule with the existing look-ahead dispatching rules. Computational experience indicates that the combined MDR dispatching rules provide solutions of better quality and consistency than the dispatching rules tested in a resource-constrained job shop.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.47-57
• /
• 2000

In this paper we consider an n-job non-preemptive and identical parallel machine scheduling problem of minimizing the sum of earliness and tardiness with different release times and due dates. In the real world this problem is more realistic than the problems that release times equal to zero or due dates are common. The problem is proved to be NP-complete. Thus a heuristic is developed to solve this problem To illustrate its suitability a proposed heuristic is compared with a genetic algorithm for a large number of randomly generated test problems. Computational results show the effectiveness and efficiency of proposed heuristic. In summary the proposed heuristic provides good solutions than genetic algorithm when the problem size is large.

• Korean Management Science Review
• /
• v.33 no.1
• /
• pp.89-99
• /
• 2016

A scheduled airlift is the most critical part of the air transportation operations in ROK Air Force. The military cargo-plane routing problem is a PDPLS (pickup and delivery problem in which load splits and node revisits are allowed). The cargo which is transported by a military cargo-plane is measured in pallet. The efficiency of pallet needs to be considered with respect to its volume and weight. There are some guidelines about orders of priorities and regulations in the military air transportation. However, there are no methodologies which can raise the efficiency of flight scheduling using Operations Research (OR) theories. This research proposes the effective computing methodology and the related heuristic algorithms that can maximize the effectiveness of the path routing model.

• Korean Management Science Review
• /
• v.31 no.3
• /
• pp.13-26
• /
• 2014

This paper considers an integrated one-vendor multi-buyer production-inventory model where the vendor manufactures multiple products in lot at their associated finite production rates. In the model, it is allowed for each product to be shipped in lot to the buyers even before the whole product production is not completed yet. Each product lot is dispatched to the associated buyer in a number of shipments. The buyers consume their products at fixed rates. The objective is to the production and shipment schedules in the integrated system, which minimizes the total cost per unit time. The total cost consists of production setup cost, inventory holding cost and shipment cost. For the model, an iterative optimal solution procedure with shipment consolidation policy incorporated. It is then tested through numerical experiments to show how efficient and effective the shipment consolidation policy is.

• Proceedings of the Safety Management and Science Conference
• /
• 2004.05a
• /
• pp.291-294
• /
• 2004

Last 2003, the CRM mayor was not lively glaringly. At beginning of the year, it may be said that gained result fewer than half of that is forecasted. Enterprises are seen that there are a lot of occasions that did not carry CRM project that planned very first time in practice or put off investment program until 2004 altogether. This can see that it is thing which CRM's accuracy of data analysis process drops up to now and investment of enterprises is unprepared. In this paper, It consolidates the necessity on a LTV (Life Time Value) and analyzes data which is concerned of Customer Value. Under the these environments, defines the LTV rule that can improve the customer value. And then, Scheduling plays an important role in shop floor planning. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem.

• Proceedings of the Safety Management and Science Conference
• /
• 2003.05a
• /
• pp.53-61
• /
• 2003

The process of railway traffic planning is composed of several steps such as long - term, mid - term, short - term, and real - time plan. The planning of vehicle and manpower resources is a main research topic in tactical short - term planning step Railway vehicle is usually consisted of a power car, passenger/freight cars and human resource is composed of engine driver, cabin crew, ground personnel. So far , power car was main research target in railway vehicle scheduling problem. Recently according as the light electric railway or high - speed railway is introduced, the operational planning of train set vehicles become important . In this paper , we introduce the conceptional model for trainset restoring problem and developed heuristic algorithm.

• Journal of Korean Society for Quality Management
• /
• v.22 no.3
• /
• pp.161-178
• /
• 1994

FMS are being installed to improve productivity, manufacturing consistency and flexibility. However, FMS are quite expensive and efforts must be made to avoid the high investment risk. The objective of this paper is to enable the real-time rescheduling under dynamic changes in FMS environment. For this purpose, a KBSS (Knowledge-Based Scheduling System) in FMS environment is developed. This KBSS will meet various requirements of users, for example, to minimize makespan, average flow time, or to maximize machine utilization.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.941-946
• /
• 2005

It is essential for project managers to make schedule adjustment based on their professional experience, in terms of rescheduling action discussed in this paper. This paper discusses the topics of resource-constrained construction rescheduling by modifying the concepts of manufacturing rescheduling. Moreover, the influence factors of construction rescheduling problems are investigated and identified in this paper. According to initial schedule plan and present progress, a new rescheduling mechanism based on Constraint Programming (CP) techniques is developed to reschedule projects with the objective of minimizing total project cost or duration, under three rescheduling policies. Through case study, the behavior of three different rescheduling policies is analyzed and discussed in this paper.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.1118-1123
• /
• 2005

This paper proposes the CPM bar chart (CBC), a hybrid of the bar chart and the critical path method (CPM). The CBC overcomes shortages of the fence bar chart, while still retaining its advantages. The fence with direction is applied instead of the broken fence, which triggers considerable problems to identify and apply in the fenced bar chart. In addition, the notorious task to find dummy activities is no longer required. Upon the benefits of simplicity in the bar chart and logical work sequence in the CPM network, the CBC provides a relatively easy way to create and understand a schedule, thus improving communication quality between project participants.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4108-4122
• /
• 2016

To address challenges of an unprecedented growth in mobile data traffic, the ultra-dense network deployment is a cost efficient solution to off-load the traffic over other small cells. However, the real traffic is often much lower than the peak-hour traffic and certain small cells are superfluous, which will not only introduce extra energy consumption, but also impose extra interference onto the radio environment. In this paper, an elastic energy efficient cell management scheme is proposed based on flow scheduling among multi-layer ultra-dense cells by a SDN controller. A significant power saving was achieved by a cell-level energy manager. The scheme is elastic for energy saving, adaptive to the dynamic traffic distribution in the office or campus environment. In the end, the performance is evaluated and demonstrated. The results show substantial improvements over the conventional method in terms of the number of active BSs, the handover times, and the switches of BSs.