• Title/Summary/Keyword: on-line scheduling

Search Result 171, Processing Time 0.028 seconds

A Multistage Metaheuristic Scheduling Algorithm in LCD Module Lines Composed of Processes (세부공정으로 구성된 LCD 모듈 라인의 다중스테이지 메타휴리스틱 스케줄링 알고리즘 연구)

  • Suh, Jungdae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.38 no.4
    • /
    • pp.262-275
    • /
    • 2012
  • This paper develops a multistage scheduling algorithm for the module operation of the LCD(Liquid Crystal Display) production systems and tests the efficiency of the proposed algorithm. The module operation is a multistage form composed of multiple sub operations of processes, and each stage is consists of multiple lines with the same kinds of machines. This paper presents a mathematical modeling reflecting the constraints of the LCD module operation and develops a multistage scheduling algorithm based on tabu search metaheuristic approach. For this purpose, an production order is assigned to a line of the sub operations and a sequence of the assigned order is rearranged to draw an efficient schedule. Simulation experiments test performance measures and show the efficiency of the proposed algorithm.

Scheduling of Welding Robots for Shipyard Sub-assembly Process (조선 소조립 공정의 자동화를 위한 용접 로봇 스케줄링)

  • Kang, Jang-Ha;Park, Sung-Soo;Park, Kyung-Chul;Do, Ki-Sang
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.1
    • /
    • pp.21-34
    • /
    • 1999
  • We consider a scheduling problem arising in a shipyard subassembly welding process. There are four welding robots of gantry type, which perform the welding process for the subassemblies. Because the robots perform the welding operations at the same time, there is a possibility of collision between adjacent robots depending on the welding schedule. In this paper, we propose a heuristic method to find a welding schedule which does minimize the welding completion time while avoiding collision among the robots. The method consists of two phases: assignment and scheduling. In the assignment phase, we assign each welding line to a proper robot. In the scheduling phase, we determine the welding schedules for the robots so that collision is avoided. Computational experiences with the data which reflect the real situation are reported.

  • PDF

A Study on the Body Welding Operation Scheduling Considering the Assembly Line's Input Sequence in Construction Equipment Manufacturing (건설기계 조립 라인 투입 순서를 고려한 제관 공정 생산 스케줄링에 관한 연구)

  • Kim, Ki-Dong;Choi, Ho-Sik
    • Journal of Industrial Technology
    • /
    • v.27 no.A
    • /
    • pp.69-76
    • /
    • 2007
  • The body of an excavator, one sort of the construction equipment, consists of mainframe part, track frame part, boom part and arm part. The all parts are manufactured in the body welding operation. The scheduling in the body welding operation of a construction equipment manufacturing is to take all the various constraints into consideration. The offset time, due date, daily capacity of operations, daily jig's capacity, precedence relation, outsourcing, alternative resource and all of the shop floor environment should be considered. An APS(Advanced Planning & Scheduling) system is a proper and efficient system in such circumstance. In this paper, we present an APS system, the optimal scheduling system for the construction equipment manufacturing specifically for the body welding operation, using ILOG Solver/Scheduler. ILOG Solver/Scheduler is a general purposed commercial software which supports to find a feasible or optimal solution using object oriented technique and constraints satisfaction programming, given constraints and objectives.

  • PDF

Application Characteristic-based Divided Scheduling for Multicore Systems

  • Park, Jung Kyu;Kim, Jaeho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.6
    • /
    • pp.9-16
    • /
    • 2017
  • In this paper, we proposed a novel user-level scheduling scheme that monitors applications characteristics on-line using PMU and allocates applications into cpu cores. We utilize PMU (Performance Monitoring Unit) to analyze which shared resource has the strongest relation with the influence. Using the proposed scheduling method, it is possible to reduce the contention of shared resources. The key idea of this scheme is separating high-influential applications into different processors. The evaluation results have shown that the proposed scheduling scheme can enhance the performance up to 12% for a 8 core system and up to 25% for a 28 core system, respectively.

A Soft Aperiodic Real-Time Task Scheduling Algorithm Supporting Maximum Slack Time (최대여유시간 제공 연성 비주기 실시간 태스크 스케줄링 알고리즘)

  • Im, Deok-Ju;Park, Seong-Han
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.37 no.4
    • /
    • pp.9-15
    • /
    • 2000
  • The purpose of this paper is to minimize the a slack computation time of the scheduling of a soft aperiodic real-time tasks in a fixed priority real-time system. The proposed algorithm reduces the computation overhead at on-line time and supports the maximum slack time assigned for aperiodic real-time tasks. The proposed algorithm has 10~20% more response time for aperiodic real-time tasks than that of Slack Stealing Algorithm that offers optimal response time in fixed priority real-time system. However, the performance of the proposed algorithm is seven times better in a scheduling overhead.

  • PDF

Bottleneck Scheduling for Cycletime Reduction in Semiconductor Fabrication Line (반도체 FAB공정의 사이클타임 단축을 위한 병목일정계획)

  • 이영훈;김태헌
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.298-301
    • /
    • 2001
  • In semiconductor manufacturing, wafer fabrication is the most complicated and important process, which is composed of several hundreds of process steps and several hundreds of machines involved. The productivity of the manufacturing mainly depends on how well they control balance of WIP flow to achieve maximal throughput under short manufacturing cycle time. In this paper mathematical formulation is suggested for the stepper scheduling, in which cycle time reduction and maximal production is achieved.

  • PDF

Modularized Gain Scheduled Fuzzy Logic Control with Application to Nonlinear Magnetic Bearings

  • Hong, Sung-Kyung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.9 no.4
    • /
    • pp.384-388
    • /
    • 1999
  • This paper describes an approach for synthesizing a modularized gain scheduled PD type fuzzy logic controller(FLC) of nonlinear magnetic bearing system where the gains of FLC are on-line adapted according to the operating point. Specifically the systematic procedure via root locus technique is carried out for the selection of the gains of FLC. Simulation results demonstrate that the proposed gain scheduled fuzzy logic controller yields not only maximization of stability boundary but also better control performance than a single operating point (without gain scheduling)fuzzy controller.

  • PDF

Study on the Calculation of the Optimal Power System Operation Considering Line Contingencies and Line Capacities (선로사고 및 선로용량을 고려한 전력계통 최적운영에 관한 연구)

  • 박영문;백영식;서보혁;신중린
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.36 no.9
    • /
    • pp.609-615
    • /
    • 1987
  • The optimal operation of power system is developed by alternately using real power dispatch and reactive power dispatch problem. The real power system scheduling process is formulated as an optimization problem with linear inequality constraints. A.C. loadflow method is used for the problem solution and line losses are considered. The constraints under consideration are generator power limits, load scehdling limits and line capacity limits. In solving the objective function the Dual Relaxation method is adopted. Tests indicate that the method is practical for real time application. The reactive power control problem uses the Dual Simplex Relaxation method as in the real scheduling case. Insted of minimizing the cost of power system, the objective is selected as to determine the highest possible voltage schedule. The constraints under consideration are the voltage limits at each node and the possibilities of supply or absobtion of reactive energy by generator units and the compensation facilities. Tests indicate that the method is practical for real time applications. The overall optimization methods developed in this paper proved to obtained fine results in minimizing object function compared with the method without using voltage control. And the overall voltage profiles were also improved.

  • PDF

On-line Scheduling Algorithms for Reducing the Largest Weighted Error Incurred by Imprecise Tasks (부정확 타스크의 최대가중치 오류를 최소화시키는 온라인 스케쥴링 알고리즘)

  • Lee, Chun-Hi;Ryu, Won;Song, Ki-Hyun;Choi, Kyung-Hee;Jung, Gy-Hyun;Park, Seung-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6B
    • /
    • pp.1032-1041
    • /
    • 1999
  • This paper proposes on-line scheduling algorithms that reduce the largest weighted error incurred by preemptive imprecise tasks running on a single processor system. The first one is a two-level algorithm. The top-level scheduling, which is executed whenever a new task arrives, determines the processing times to be allotted to tasks in such a way to minimize maximum weighted error as well as to minimize total error. The lower-level algorithm actually allocates the processor to the tasks. The second algorithm extends the on-line algorithm studied by Shih and Liu[4] by formalizing the top-level algorithm mathematically. The numerical simulation shows that the proposed algorithm outperforms the previous works in the sense that it greatly reduces the largest weighted error.

  • PDF

Study on the Calculation of the Optimal Power Operation Considering Line Contingencies (상정사고를 고려한 전력계통 최적운용에 관한 연구)

  • 박영문;백영식
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.33 no.6
    • /
    • pp.241-246
    • /
    • 1984
  • The power system scheduling process is formulated as an optimization problem with linear inequality constraints. AC Loadflow method is used for the problem solution and line losses are considered. The constraints under consiceration are generator power limits, load schedding limits and line capacity limits. In solving the objective function the Dual Relaxation method is adopted. Tests indicate that the method is practical for real time applications.

  • PDF