• Journal of Korean Society for Quality Management
• /
• v.20 no.1
• /
• pp.136-146
• /
• 1992

Most of scheduling papers on FMS have been considered that the fabrication process, the machining process and the assembly process etc. are independent and the releasing, routing, dependent, batching, loading problem are treated separetely. In this paper, we discuss that the integrated scheduling problem which can be solved for efficient use. We combine two systems that each process system which in order to produce a product is treated dependently, the releasing and the routing problem are combined one system and we present the efficient flexible manufacturing system as including the alternate process.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.10a
• /
• pp.3-8
• /
• 1998

주문형 비디오 시스템의 성능에서 중요한 문제는 클라이언트 요구를 만족시키기 위한 입출력 대역폭이다. 이러한 입출력 대역폭을 감소시키기 위해 하나의 비디오 스트림을 사용하여 다중 요청을 처리하는 많은 정책들; 배칭. 피기백 머징, 버퍼링이 연구되고 있다. 본 논문에서는 인기 있는 비디오들에 대한 서비스 요청들이 매 배칭 간격마다 스케줄될 수 있도록 인기 있는 비디오들을 위한 서버 스트림 용량을 동적으로 예약해 두는 예약 기반 동적 배칭 정책을 제안하고, 그것의 성능을 시뮬레이션을 통하여 단순 배칭 정책과 비교하고 평가한다.

• Proceedings of the Korean Society of Dyers and Finishers Conference
• /
• 2009.03a
• /
• pp.213-214
• /
• 2009

In order to promote an efficiency CPB process, we developed microwave system in CPB process. The whiteness and penetration ability of microwave-CPB pre-treated fabrics were superior to CPB only. This results indicates that microwave-CPB pre-treatment promotes CPB efficiency in agent usages and batching time.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.1025-1032
• /
• 2003

Percentiles are convenient measures of the entire range of values of simulation outputs. However, unlike means and standard deviations, the observations have to be stored since calculation of percentiles requires several passes through the data. Thus, percentile (PE) requires a large amount of computer storage and computation time. The best possible computation time to sort n observations is (O($nlog_{2}n$)), and memory proportional to n is required to store sorted values in order to find a given order statistic. Several approaches for extimating percentiles in RS(regenerative simulation) and non-RS, which can avoid difficulties of PE, have been proposed in [11, 12, 21]. In this paper, we implemented these three approaches known as : leanear PE, batching PE, spectral $P^2$ PE in the context of sequential steady-state simulation. Numerical results of coverage analysis of these PE approachs are present.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.385-395
• /
• 1999

Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.3 no.4
• /
• pp.33-45
• /
• 1983

In the course of transportation of ready mixed concrete, it sometimes happens that time of haul from mixing at a batching plant to placing of the concrete at a job site is prolonged too much. When it does happen, improvement in the concrete workability needs to be made by proper measures. It is proposed, therefore, to discuss the quality of concrete modified by time of haul and to search for methods for improvement of the quality by means of adding cement and water or superplasticizer. It was found in this experiment that retempering concrete with superplasticizer is useful in coping with the quality deterioration.

• Journal of Korean Society for Quality Management
• /
• v.36 no.2
• /
• pp.28-35
• /
• 2008

This study deals with an Excel-based scheduling system for a small and medium sized manufacturing factory without sufficient capability for managing full-scale information systems. The factory has the bottleneck with identical machines and unique batching characteristics. The scheduling problem is formulated as a variation of the parallel-machine scheduling system. It can be solved by a two-phase method: the first phase with an ant colony optimization (ACO) heuristic for order grouping and the second phase with a mixed integer programming (MIP) algorithm for scheduling groups on machines.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.4
• /
• pp.35-47
• /
• 2006

This paper considers an integrated scheduling problem for consecutive production and delivery stages in a two-stage supply chain. The Production is performed on a single facility and then the finished products are delivered to the customer by capacitated multiple vehicles. The objective of this paper is to obtain job sequencing and delivery batching minimizing the total cost of the associated WIP inventory, finished product inventory and delivery. The inventory cost is characterized by the sum of weighted flowtime. The delivery cost is proportional to the required number of delivery batches. Some polynomial-solvable cases are derived. For the general case, two efficient heuristic algorithms are suggested, and then the heuristics are tested through some numerical experiments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.2
• /
• pp.31-38
• /
• 1994

We consider a single-machine scheduling problem dealing with the manufacture of components for subsequent assembly into end products. Each product requires both unique components and common components, and each production requires a setup. By making some assumptions on the data and the availability of the components for assembly, Baker provides on efficient dynamic programming algorithm for obtaining the optimal schedule. In this paper we do not impose any requirement on the data, and we solve the more complicated batching and sequencing problem. We suggest a simple heuristic method that is efficient and finds solutions that are optimal or close to the optimal solution.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.424-426
• /
• 2004

VOD 시스템은 실시간으로 사용자의 요구를 받아들여 동영상 서비스를 제공하는 시스템으로서 크게 서비스를 제공하는 서버와 사용자의 요구를 처리하는 클라이언트로 구성된다. VOD 서버와 클라이언트 설계 시 다양한 요소들을 고려하여야 하는데 그 중에서도 서버와 클라이언트를 연결해주는 네트워크가 큰 비중을 차지한다. 본 연구에서는 그 동안 제안된 다양한 멀티캐스트 기반의 VOD시스템들 중에서 네트워크부하가 적은 Batching방식을 이용하는 VOD시스템을 설계하고 구현하고자 한다. 실시간 스트리밍 서비스를 위해 개발된 RTP와 RTSP률 도입하여 멀티캐스트 서비스의 안정성을 높이고자 하였다. 일반적인 재생을 위한 데이터와 빠른 재생을 위한 데이터 모두 멀티캐스팅 함으로써 클라이언트의 버퍼 요구량을 줄이고자 하였다.