• Industrial Engineering and Management Systems
• /
• 제3권1호
• /
• pp.12-21
• /
• 2004

This paper investigates the design of a priority rule in a multi-product disassembly environment. Specifically, it is concerned with product scheduling by which the inventory control of disassembled parts can be incorporated into a priority rule to reduce part lead times. The part lead time consists of two components: flow time and supply delay. The primary focus of the paper is on the development of a disassembly priority rule that aims to reduce the supply delay. We propose a priority rule, called Minimum Distance (MD) rule, to improve the supply delay performance. Finally, we provide a comparative analysis on the performance of traditional rules and the new rule proposed in this paper via a simulation model.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2009년도 춘계학술대회 논문집
• /
• pp.1057-1058
• /
• 2009

• 산업경영시스템학회지
• /
• 제43권3호
• /
• pp.10-20
• /
• 2020

This paper presents a method to measure the similarity of assigned jobs in the gravure printing operation based on the chromaticity and color sequence, and order the jobs accordingly. The proposed dispatching rule can be used to fulfill diverse manufacturing site requirements because the parameters can be adjusted to prioritize chromaticity and color sequence. In general, dispatching rules either ignore the job-changing time or require that the time be clearly defined. However, in the gravure printing operation targeted in this study, it is difficult to apply the general dispatching rule because of the difficulties in quantifying the job-changing time. Therefore, we propose a method for generalizing assignment rules of the job planner, allocating relative similarity among assigned jobs, and determining the sequence of jobs accordingly. Chromaticity priority is determined by the arrangement of the color assignments in the printing operation; color sequence priority is determined by the addition, deletion, or change in a specific color sequence. Finally, the job similarity is determined by the dot product of the chromaticity and color sequence priorities. Implementation of the proposed dispatching rule at an actual manufacturing site showed the planner present the same job order as that obtained using the proposed rule. Therefore, this rule is expected to be useful in industrial sites where clear quantification of the job-changing time is not possible.

• 한국경영과학회지
• /
• 제35권2호
• /
• pp.1-17
• /
• 2010

This paper aims to compare four operating priority rules of RMGC (Rail Mounted Gantry Crane) used in semi-automated container terminal. The four priority rules employed in this paper are FCFS (First-come-first-served), LCFS (Last-come-first-served), TOS (Turn-over-served) and NFS (Nearest-first-served). And to compare the four operating priority rules, this paper analyzed productivity of RMGC and CC (Container Crane), waiting time of YT (Yard Truck) and RT (Road Truck) in container yard, and turnaround time of RT in container terminal of each priority rule by using stevedoring simulation. As a result, NFS was evaluated as the best rule to improve the overall productivity of container terminal in terms of all criteria.

• Management Science and Financial Engineering
• /
• 제17권1호
• /
• pp.79-94
• /
• 2011

Team orienteering, an extension of single-competitor orienteering, is the problem of determining multiple paths from a starting node to a finishing node for a given allowed time or distance limit fixed for each of the paths with the objective of maximizing the total collected score. Each path is through a subset of nodes, each of which has an associated score. The team orienteering problem has many applications such as home fuel delivery, college football players recruiting, service technicians scheduling, military operations, etc. Unlike existing optimal and heuristic algorithms often leading to heavy computation, this paper suggests two types of priority rule based heuristics-serial and parallel ones-that are especially suitable for practically large-sized problems. In the proposed heuristics, all nodes are listed in an order using a priority rule and then the paths are constructed according to this order. To show the performances of the heuristics, computational experiments were done on the small-to-medium sized benchmark instances and randomly generated large sized test instances, and the results show that some of the heuristics give reasonable quality solutions within very short computation time.

• 한국국방경영분석학회지
• /
• 제2권1호
• /
• pp.177-184
• /
• 1976

As the organizational size of a military service or business increases and its management becomes complex, the success in its management depends less on static type of management but more on careful, dynamic type of management. In this thesis, an operations research technique is applied to the problems of determining optimal air traffic control rule and of optimal capacity of air base for a military air base. An airport runway is regarded as the service facility in a queueing mechanism, used by landing, low approach, and departing aircraft. The usual order of service gives priority different classes of aircraft such as landings, departures, and low approaches; here service disciplines are considered assigning priorities to different classes of aricraft grouped according to required runway time. Several such priority rules are compared by means of a steady-state queueing model with non-preemptive priorities. From the survey conducted for the thesis development, it was found that the flight pattern such as departure, law approach, and landing within a control zone, follows a Poisson distribution and the service time follows an Erlang distribution. In the problem of choosing the optimal air traffic control rule, the control rule of giving service priority to the aircraft with a minimum average waiting cost, regardless of flight patterns, was found to be the optimal one. Through a simulation with data collected at K-O O Air Base, the optimal take-off interval and the optimal capacity of aircraft to be employed were determined.

• 한국시뮬레이션학회논문지
• /
• 제8권2호
• /
• pp.101-109
• /
• 1999

In a commercial facsimile network system, a simulation analysis has been performed using ARENA due to the unavailability of theoretical models. The effect of a priority is compared with that of the current FCFS rule on the arriving call blocking rate and transmission time delay. The result shows that the priority rule reduces more service time delay as the arrival rate increases. A simulation analysis procedure is proposed to select optimal in/out port ratio at various hourly arrival rates with a given multiple-place transmission requests ratio.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.15-16
• /
• 2007

In order to provide value-added services, next generation routers should perform packet classification for each incoming packet at wire-speed. In this paper, we proposed hierarchical priority trio (Hptrie) for packet classification. The proposed scheme improves the search performance and the memory requirement by replacing empty internal nodes in ordinary hierarchical trio with priority nodes which are the nodes including the highest priority rule among sub-trie nodes.

• 한국항해학회지
• /
• 제23권4호
• /
• pp.21-28
• /
• 1999

In some cases a towing vessel and her tow, a fishing boat, and a vessel at anchor have a priority against a general power-driven vessel underway in the application of collision rule. This article aims at suggesting a practical guide for the construction of the meaning of a vessel engaging in fishing, a vessel engaged in towing operation such as severely restricts the towing vessel and her tow in their ability to deviate from their course and a vessel at anchor, which are permitted to have the above priority. The construction of the application of the collision rule on the above vessels is supported by the decisions of MAIA and the judgment of civil courts.

• 한국방사성폐기물학회:학술대회논문집
• /
• 한국방사성폐기물학회 2005년도 추계 학술대회 논문집
• /
• pp.189-190
• /
• 2005