• Title/Summary/Keyword: Scheduling System

Search Result 2,159, Processing Time 0.028 seconds

The Operational Optimization of Semiconductor Research and Development Fabs by FAB-wide Scheduling (FAB-Wide 스케줄링을 통한 반도체 연구라인의 운용 최적화)

  • Kim, Young-Ho;Lee, Jee-Hyong;Sun, Dong-Seok
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.4
    • /
    • pp.692-699
    • /
    • 2008
  • Semiconductor research and development(R&D) fabs are very different than production fabs in many ways such as the scales of production, job priority, production methods, and performance measures. Efficient operations of R&D fabs are very important to the development of new product, process stability, high yield, and ultimately company competitiveness. This paper proposes the fab-wide scheduling method for operational optimization of the R&D fabs. Most scheduling systems of semiconductor fabs have only focused on maximizing throughput of each separated areas without considering WIP(works in process) flows of entire fab. In this paper, we proposes the a fab-wide scheduling system which schedules all lots to entire fab equipment at once. We develop the MIP(mixed integer programing) model which allocates the lots to production equipment considering many constraints of all processes and the CP(constraint programming) model which determines the sequences of the lots in the production equipment. The proposed FAB-wide scheduling model is applied to the newly constructed R&D fab. As a result, we have accomplished the system based automated job reservation, decrease of the hot lot delay, increase of the queue time satisfaction, the high throughput by maximizing the batch sizes, decrease of the WIP TAT(Turn Around Time).

IMPROVING THE USABILITY OF STOCHASTIC SIMULATION BASED SCHEDULING SYSTEM

  • Tae-Hyun Bae;Ryul-Hee Kim;Kyu-Yeol Song;Dong-Eun Lee
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.393-399
    • /
    • 2009
  • This paper introduces an automated tool named Advanced Stochastic Schedule Simulation System (AS4). The system automatically integrates CPM schedule data exported from Primavera Project Planner (P3) and historical activity duration data obtained from a project data warehouse, computes the best fit probability distribution functions (PDFs) of historical activity durations, assigns the PDFs identified to respective activities, computes the optimum number of simulation runs, simulates the schedule network for the optimum number of simulation runs, and estimates the best fit PDF of project completion times (PCTs). AS4 improves the reliability of simulation-based scheduling by effectively dealing with the uncertainties of the activities' durations, increases the usability of the schedule data obtained from commercial CPM software, and effectively handles the variability of the PCTs by finding the best fit PDF of PCTs. It is designed as an easy-to-use computer tool programmed in MATLAB. AS4 encourages the use of simulation-based scheduling because it is simple to use, it simplifies the tedious and burdensome process involved in finding the PDFs of the many activities' durations and in assigning the PDFs to the many activities of a new network under modeling, and it does away with the normality assumptions used by most simulation-based scheduling systems in modeling PCTs.

  • PDF

Development of an Effective Manufacturing Scheduling System for PCB Manufacturing Line Using Dual DBR Method (복수 DBR 기법을 이용한 PCB 생산라인의 효율적인 생산계획 시스템 개발)

  • Yoshida, Atsunori;Park, Jeong-Hyeon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.10
    • /
    • pp.2935-2944
    • /
    • 2009
  • This paper proposes Dual DBR(Drum-Buffer-Rope) system for a small-to-medium-sized PCB(Printed Circuit Board) manufacturing line. DBR method of TOC(Theory of Constraints) is an effective system for a small-to-medium-sized company to build production scheduling system. But to apply it to PCB line, it needs more technical consideration because of multiple constraints, looping process line and complex buffer management. This paper proposes an answer of these problems using Dual DBR to build production scheduling system more successfully. And it was confirmed that lead time was reduced more than 20% applying Dual DBR system to a domestic PCB manufacturing line actually.

A Study on the Process Design of Advanced Planning & Scheduling for Transformer Operation Improvement (변합기 공정 개선을 위한 APS(Advanced Planning & Scheduling) 프로세스 설계에 관한 연구)

  • Hwang, Duk-Hyuong;Nam, Seung-Don;Cho, Young-Wook;Oh, Sun-Il;La, Seoung-Hun;Kang, Kyong-Sik
    • Journal of the Korea Safety Management & Science
    • /
    • v.14 no.2
    • /
    • pp.159-166
    • /
    • 2012
  • As enterprises, based on the forecast of the customer's demand and collaboration with the suppliers, establish the integrated system directing supply, production, and distribution for the increase of productivity, Thus, this study intends to find the most urgent and critical factors for the improvement of the information system by externalizing factors affecting the operation of information system, suggest the process to improve the relevant functions of information system, and design the process. As a result of the analysis of the previous studies on the improvement of the information system, many studies were conducted on the improvement of ERP and SCM, yet there was no study conducted targeting about APS (Advanced Planning & Scheduling). Thus, this study chose APS as the subject for the design of the process for the improvement for the information system.

User Scheduling Algorithm Based on Signal Quality and Inter-User Interference for Outage Minimization in Full-Duplex Cellular Networks (전이중 셀룰라 네트워크에서 아웃티지 최소화를 위한 신호 품질과 사용자간 간섭량 기반의 사용자 스케쥴링 알고리즘)

  • Choi, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.11
    • /
    • pp.2576-2583
    • /
    • 2015
  • In a full-duplex (FD) wireless cellular network, uplink (UL) users induce the severe inter-user interference to downlink (DL) users. Therefore, a user scheduling that makes a pair of DL user and UL user to use the same radio resource simultaneously influences the system performances significantly. In this paper, we first formulate an optimization problem for user scheduling to minimize the occurrence of outage, aiming to guarantee the quality of service of users, and then we propose a suboptimal user scheduling algorithm with low complexity. The proposed scheduling algorithm is designed in a way where the DL user with a worse signal quality has a higher priority to choose its UL user that causes less interference. Simulation results show that the FD system using the proposed user scheduling algorithm achieves the optimal performance and significantly decreases the outage probability compared with the conventional half-duplex cellular system.

Holistic Scheduling Analysis of a CAN based Body Network System (CAN을 이용한 차체 네트웍 시스템에 대한 Holistic 스케줄링 해석)

  • 신민석;이우택;선우명호
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.10 no.5
    • /
    • pp.114-120
    • /
    • 2002
  • In a distributed real-time control system, it is essential to confirm the timing behavior of all tasks because these tasks of each real-time controller have to finish their processes within the specified time intervals called a deadline. In order to satisfy this objective, the timing analysis of a distributed real-time system such as shcedulability test must be performed during the system design phase. In this study, a simple application of CAN fur a vehicle body network system is formulated to apply to a holistic scheduling analysis, and the worst-case execution time (WCET) and the worst-case end-to-end response time (WCRT) are evaluated in the point of holistic system view.

A Note on the Reversibility of the Two Stage Assembly Scheduling Problem

  • Yoon, Sang-Hum;Lee, Ik-Sun;Sung, Chang-Sup
    • Management Science and Financial Engineering
    • /
    • v.13 no.1
    • /
    • pp.25-34
    • /
    • 2007
  • This paper is concerned with proving a conjecture that the two stage assembly system is reversible in deterministic makespan scheduling context. The reversibility means that a job sequence in the assembly system has the same makespan as that of its reverse sequence in the disassembly system which is the reversal of the assembly system. The proposed conjecture shows that the reversibility of serial flowshops can be extended to non-serial and synchronized shops.

Design and Implementation of a Scheduling Secretary Agent System Based on HTTP Client/Server Mechanism (HTTP 클라이언트/서버에 기반한 스케쥴링 비서 에이젼트 시스템의 설계 및 구현)

  • Park, Chang-Hyeon;Jeong, Ho-Yeol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.3
    • /
    • pp.862-870
    • /
    • 2000
  • Recently, according to the rapid development of internet and communication technologies, a lot of works based on network techniques have been developed. In relation to this trend, the agent systems that had been studied in the early AI have been being studied greatly in association with the network techniques. This paper present a design model of a secretary agent system in which each secretary agent can manage the schedules of her/his superior, and the descriptions about the implementation of the secretary agent system. In the presented secretary agent system, a database system and a knowledge-based systems are included and cooperated with each secretary agent to provide the ability of manipulating lots of schedule data and making decisions on them. This paper also shows that the presented secretary agent system can behavior like a real secretary through the various superior-secretary-meeting-requester interactions, which is different from the roup scheduling programs or personal scheduling programs.

  • PDF

A Novel Processor Allocation Policy for List Scheduling in Distributed Heterogeneous Computing System (분산 이기종 시스템에서 리스트 스케줄링 알고리즘을 위한 새로운 프로세서 할당 정책)

  • Yoon, Wan-Oh;Song, In-Seong;Yoon, Jun-Chol;Choi, Sang-Bang
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.2
    • /
    • pp.76-89
    • /
    • 2010
  • The performance of Distributed Heterogeneous Computing System depends on the algorithm which schedules input DAG graph. Among various scheduling algorithms, list scheduling algorithm provides superior performance with low complexity. List scheduling consists of task prioritizing phase and processor allocation phase, but most studies only focus on task prioritizing phase. In this paper, we propose LIP policy which has the same complexity with traditional allocation policies but has superior performance. The performance of LIP has been observed by applying them to task prioritizing phase of traditional list scheduling algorithms, HCPT, HEFT, GCA, and PETS. The results show that LIP has better performance than insertion-based policy and non-insertion-based policy, which are traditional processor allocation policies.

User Scheduling Algorithm for Cell Capacity Maximization in Full Duplexing Wireless Cellular Networks (전이중 무선 셀룰라 네트워크에서 셀 용량 최대화를 위한 사용자 스케쥴링 방식)

  • Choi, Hyun-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.11
    • /
    • pp.2613-2620
    • /
    • 2014
  • In this paper, we consider a full duplexing (FD) wireless cellular network where a central base station (BS) works in the FD mode while the downlink (DL) and uplink (UL) users work in the time division duplexing (TDD) mode. Since this FD system induces the inter-user interference from UL user to DL user, the main challenge for maximizing the system performances is user scheduling that makes a pair of DL user and UL user to use the same radio resource simultaneously. We formulate an optimization problem for user pairing to maximize the cell capacity and propose a suboptimal user scheduling algorithm with low complexity. This scheduling algorithm is designed in a way where the DL user with a better signal quality has a higher priority to choose its UL user that causes less interference. Simulation results show that the FD system using the proposed user scheduling algorithm achieves the optimal performance and significantly outperforms the conventional TDD system in terms of the cell capacity.