• Title/Summary/Keyword: dispatching

Search Result 347, Processing Time 0.028 seconds

Dispatching Rule based on Chromaticity and Color Sequence Priorities for the Gravure Printing Operation (색도 및 색순에 따른 그라비아 인쇄 공정의 작업 순서 결정 규칙)

  • Bae, Jae-Ho
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.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.

Beam Scheduling Algorithm of Multi-Function AESA Radar Based on Dispatching Rules (Dispatching Rule에 기반한 능동 위상 배열 다기능 레이더의 빔 스케줄링 기법)

  • Roh, Ji-Eun;Ahn, Chang-Soo;Kim, Seon-Joo
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.1
    • /
    • pp.1-13
    • /
    • 2012
  • AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability, compared with mechanically scanned array radar. AESA radar brings a new challenges, radar resource management(RRM), which is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed the several dispatching rules for radar beam scheduling, and compared the performance on the multi-function radar scenario. We also showed that the dispatching rule which differently applying SPF(Shortest Processing time First) and ERF(Earliest Request time First) according to beam processing latency is the most efficient.

Yard Crane Dispatching for Remarshalling in an Automated Container Terminal (자동화 컨테이너 터미널에서 이적작업을 위한 장치장 크레인 작업할당)

  • Bae, Jong-Wook;Park, Young-Man
    • Journal of Navigation and Port Research
    • /
    • v.36 no.8
    • /
    • pp.665-671
    • /
    • 2012
  • A remarshalling is studied as an important operational strategy in an automated container terminal to enhance the productivity of container handling. This means the rearrangements of the containers scattered at a vertical yard block. The dispatching problem for remarshalling is selecting the remarshalling operation considering the available operation time and deciding the operation sequencing to maximize the effectiveness of remarshalling. This study develops the optimal mathematical model for yard crane dispatching problem with mixed integer program and explains dispatching problem using an example. However it is difficult to apply this model to a field problem because of its computational time. Therefore, we compare the representative 5 dispatching rules for real world adaption. In a numerical experiment, maximum weight ratio(MR) rule shows an overall outstanding performance.

Increase of Labor Dispatching in China as a Combined Effect of the Global Financial Crisis and the 'Labor Contract Act' (세계경제위기와 '노동계약법'의 결합효과로서 중국 파견노동의 증가)

  • Baek, Seung-Wook
    • Korean Journal of Labor Studies
    • /
    • v.19 no.1
    • /
    • pp.177-211
    • /
    • 2013
  • The Chinese dual structure of employment('Shuangguizhi') has been retained through the Economic Reforms, and has been supported and reproduced by the system of division between rural and urban household registration. In the 2000s, efforts of the government to abolish the division appeared to be effective with the introduction of the 'Labor Contract Act'. However, the eclecticism of the Act and the outbreak of the global financial crisis in 2008 gave new momentum to the revival of the Chinese dual structure of employment by increasing the scale of labor dispatching. Labor dispatching in China has become a regular form of employment rather than an exceptional one. Labor dispatching reveals its Chinese characteristics against the particular background formed during the periods of state-owned-enterprise restructuring around 2000. The combined effects of the 'Labor Contract Act' and the global financial crisis brought about the effect of increase rather than control of labor dispatching, and gave a signal to enterprises to use various forms of labor dispatching including 'reverse directional labor dispatching' to lessen burdens and costs caused by the Act and the crisis. As labor dispatching strengthens or displaces the existing dual structure of employment, social groups which need more social protection tend to be much more excluded from the protection of the government and the society.

Knowledge Acquistion using Neural Network and Simulator

  • Kim, Ki-Tae;Sim, Eok-su;Cheng Xuan;Park, Jin-Woo
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.25-29
    • /
    • 2001
  • There are so many researches about the search method for the most compatible dispatching rule to a manufacturing system state. Most of researches select the dispatching rule using simulation results. This paper touches upon two research topics: the clustering method for manufacturing system states using simulation, and the search method for the most compatible dispatching rule to a manufacturing system state. The manufacturing system state variables are given to ART II neural network as input. The ART II neural network is trained to cluster the system state. After being trained, the ART II neural network classifies any system state as one state of some clustered states. The simulation results using clustered system state information and those of various dispatching rules are compared and the most compatible dispatching rule to the system state is defined. Finally there are made two knowledge bases. The simulation experiments are given to compare the proposed methods with other scheduling methods. The result shows the superiority of the proposed knowledge base.

  • PDF

Research on the WIP-based Dispatching Rules for Photolithography Area in Wafer Fabrication Industries

  • Lin, Yu-Hsin;Tsai, Chih-Hung;Lee, Ching-En;Chiu, Chung-Ching
    • International Journal of Quality Innovation
    • /
    • v.8 no.2
    • /
    • pp.132-146
    • /
    • 2007
  • Constructing an effective production control policy is the most important issue in wafer fabrication factories. Most of researches focus on the input regulations of wafer fabrication. Although many of these policies have been proven to be effective for wafer fabrication manufacturing, in practical, there is a need to help operators decide which lots should be pulled in the right time and to develop a systematic way to alleviate the long queues at the bottleneck workstation. The purpose of this study is to construct a photolithography workstation dispatching rule (PADR). This dispatching rule considers several characteristics of wafer fabrication and influential factors. Then utilize the weights and threshold values to design a hierarchical priority rule. A simulation model is also constructed to demonstrate the effect of the PADR dispatching rule. The PADR performs better in throughput, yield rate, and mean cycle time than FIFO (First-In-First-Out) and SPT (Shortest Process Time).

Dispatching to Minimize Flow Time for Production Efficiency in Non-Identical Parallel Machines Environment with Rework (재작업이 존재하는 이종병렬기계에서 생산효율을 위해 공정소요시간 단축을 목적으로 하는 작업할당)

  • Seo, Jung-Ha;Ko, Hyo-Heon;Kim, Sung-Shick;Baek, Jun-Geol
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.4
    • /
    • pp.367-381
    • /
    • 2011
  • Reducing waste for the efficiency of production is becoming more important because of the rapidly changing market circumstances and the rising material and oil prices. The dispatching also has to consider the characteristic of production circumstance for the efficiency. The production circumstance has the non-identical parallel machines with rework rate since machines have different capabilities and deterioration levels in the real manufacturing field. This paper proposes a dispatching method, FTLR (Flow Time Loss Index with Rework Rate) for production efficiency. The goal of FTLR is to minimize flow time based on such production environments. FTLR predicts the flow time with rework rate. After assessing dominant position of expected flow time per each machine, FTLR performs dispatching to minimize flow time. Experiments compare various dispatch methods for evaluating FTLR with mean flow time, mean tardiness and max tardiness in queue.

Reservation based Dispatching Rule for On-Time Delivery in System LSI Semiconductor FAB (시스템 LSI 반도체 FAB의 납기만족을 위한 예약 기반의 디스패칭 룰)

  • Seo, Jeongchul;Chung, Yongho;Park, Sangchul
    • Korean Journal of Computational Design and Engineering
    • /
    • v.19 no.3
    • /
    • pp.236-244
    • /
    • 2014
  • Presented in the paper is a reservation based dispatching rule to achieve the on-time delivery in system LSI (large scale integrated circuit) semiconductor fabrication (FAB) with urgent orders. Using the proposed reservation based dispatching rule, urgent lots can be processed without waiting in a queue. It is possible to achieve the on-time delivery of urgent orders by reserving a proper tool for the next step in advance while urgent lots are being processed at the previous step. It can cause, however, tardiness of normal lots, because the proposed rule assign urgent lots first. To solve this problem, the proposed rule tries to find the best tool for the reservation in the tool group, which can minimize idle time, and the reservation rule is applied at all tools except for photolithography tools (bottleneck). $MOZART^{(R)}$ which is developed by VMS solutions are used for simulation experiments. The experimentation results show that the reservation based dispatching rule can achieve the on-time delivery of normal lots as well as urgent lots.

Improved Dispatching Algorithm for Satisfying both Quality and Due Date (품질과 납기를 동시에 만족하는 작업투입 개선에 관한 연구)

  • Yoon, Ji-Myoung;Ko, Hyo-Heon;Baek, Jong-Kwan;Kim, Sung-Shick
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.6
    • /
    • pp.1838-1855
    • /
    • 2008
  • The manufacturing industry seeks for improvements in efficiency at the manufacturing process. This paper presents a method for effective real time dispatching for parallel machines with multi product that minimizes mean tardiness and maximizes the quality of the product. What is shown in this paper is that using the Rolling Horizon Tabu search method in the real time dispatching process, mean tardiness can be reduced to the minimum. The effectiveness of the method presented in this paper has been examined in the simulation and compared with other dispatching methods. In fact, using this method manufacturing companies can increase profits and improve customer satisfaction as well.

Performance Analysis of Scheduling Rules in Semiconductor Wafer Fabrication (반도체 웨이퍼 제조공정에서의 스케줄링 규칙들의 성능 분석)

  • 정봉주
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.3
    • /
    • pp.49-66
    • /
    • 1999
  • Semiconductor wafer fabrication is known to be one of the most complex manufacturing processes due to process intricacy, random yields, product diversity, and rapid changing technologies. In this study we are concerned with the impact of lot release and dispatching policies on the performance of semiconductor wafer fabrication facilities. We consider several semiconductor wafer fabrication environments according to the machine failure types such as no failure, normal MTBF, bottleneck with low MTBF, high randomness, and high MTBF cases. Lot release rules to be considered are Deterministic, Poisson process, WR(Workload Regulation), SA(Starvation Avoidance), and Multi-SA. These rules are combined with several dispatching rules such as FIFO (First In First Out), SRPT (Shortest Remaining Processing Time), and NING/M(smallest Number In Next Queue per Machine). We applied the combined policies to each of semiconductor wafer fabrication environments. These policies are assessed in terms of throughput and flow time. Basically Weins fabrication setup was used to make the simulation models. The simulation parameters were obtained through the preliminary simulation experiments. The key results throughout the simulation experiments is that Multi-SA and SA are the most robust rules, which give mostly good performance for any wafer fabrication environments when used with any dispatching rules. The more important result is that for each of wafer fabrication environments there exist the best and worst choices of lot release and dispatching policies. For example, the Poisson release rule results in the least throughput and largest flow time without regard to failure types and dispatching rules.

  • PDF