• Title/Summary/Keyword: hierarchical scheduling system

Search Result 46, Processing Time 0.027 seconds

A Dynamic Dispatching Algorithm for Operation of Automated Guided Vehicles and Machines in CIM Systems (CIM 시스템에서 기계가공과 AGV 의 운영을 위한 동적 작업배정 알고리듬)

  • Kim, Jung-Wook;Rhee, Jong-Tae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.1
    • /
    • pp.85-101
    • /
    • 1995
  • Automated Guided Vehicles(AGVs) are widely used in computer integrated manufacturing(CIM) systems for material handling purposes. Although automated guided vehicles provide higher levels of flexibility and computer integrability, the installations are limited in number and one of the critical reasons lies in the complexity involved in the operation. The main objective of this research is to alleviate this problem by proposing efficient integrated operational control methods for AGV-based CIM systems. Particularly, this research is concerned with the mixed problem of dispatching automated guided vehicles and scheduling machines operation. The proposed dynamic heuristic algorithm uses various priority schemes and relevant information concerning the load of the system, the status of queues, and the position of AGVs in the scheduling process. The scheduling decision process is hierarchical in the sense that different decision criteria are applied sequentially to identify the most appropriate part to be served. This algorithm consists of two sections, the section of part selection by AGVs for the next service whenever an AGV completes the current assignment, and the section of part selection by machines for next service whenever a machine completes the current operation. The proposed algorithm has been compared with other scheduling schemes using the performance measure of mean flow-time and mean tardiness. Simulation results indicate that the proposed algorithm can reduce the mean flow-time and mean tardiness significantly.

  • PDF

Hierarchical Control Scheme in Flexible Manufacturing Systems That have unreliable Machines and Maintenance (기계고장과 보전(保全)을 고려한 유연생산시스템의 계층적 통제계획)

  • Um, Wan-Sup
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.4
    • /
    • pp.619-631
    • /
    • 1996
  • This paper describes an approach for the incorporation of maintenance times into a hierarchical scheduling for a failure prone flexible manufacturing system. The maintenance should not be performed too often because of the resulting reduction of capacity. Most manufacturing systems are large and complex. It is natural to divide the control into a hierarchy consisting of a number of different levels. Each level is characterized by the length of the planning horizon and the kind of data required for the decision making process. The goal of the analysis reported here is to calculate the production requirements while the machines fail and are repaired at random times. The machine failure and preventive maintenance are considered simultaneously.

  • PDF

Load Forecasting and ESS Scheduling Considering the Load Pattern of Building (부하 패턴을 고려한 건물의 전력수요예측 및 ESS 운용)

  • Hwang, Hye-Mi;Park, Jong-Bae;Lee, Sung-Hee;Roh, Jae Hyung;Park, Yong-Gi
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.9
    • /
    • pp.1486-1492
    • /
    • 2016
  • This study presents the electrical load forecasting and error correction method using a real building load pattern, and the way to manage the energy storage system with forecasting results for economical load operation. To make a unique pattern of target load, we performed the Hierarchical clustering that is one of the data mining techniques, defined load pattern(group) and forecasted the demand load according to the clustering result of electrical load through the previous study. In this paper, we propose the new reference demand for improving a predictive accuracy of load demand forecasting. In addition we study an error correction method for response of load events in demand load forecasting, and verify the effects of proposed correction method through EMS scheduling simulation with load forecasting correction.

An Expanded Real-Time Scheduler Model for Supporting Aperiodic Task Servers (비주기적 태스크 서버들을 지원하기 위한 확장된 실시간 스케줄러 모델)

  • Shim, Jae-Hong;Kim, Yeong-Il;Choi, Hyung-Hee;Jung, Gi-Hyun;Yoo, Hae-Young
    • The KIPS Transactions:PartA
    • /
    • v.8A no.1
    • /
    • pp.16-26
    • /
    • 2001
  • This paper proposes an extended scheduler model that is an extension of the existing model proposed already in [4, 5], which consists of upper layer task scheduler and lower layer scheduling framework. However, in order to support aperiodic task scheduling, the task scheduler has been divided into two parts, such as periodic task control component and aperiodic task control component. Thus, the proposed model can support various bandwidth-preserving servers that can service aperiodic tasks. The model distinctly separates a classic monolithic kernel scheduler into several kernel components according to their functionality. This enables system developers to implement a new scheduling algorithm or aperiodic task server independent of complex low kernel mechanism, and reconfigure the system at need. In Real-Time Linux [6], we implemented the proposed scheduling framework representative scheduling algorithms, and server bandwidth-preserving servers on purpose to test. Throughout these implementations, we confirmed that a new algorithm or server could be developed independently without updates of complex low kernel modules. In order to verify efficiency of the proposed model, we measured the performance of several aperiodic task servers. The results showed this the performance of model, which even consisted of two hierarchical components and several modules, didnt have such high run-time overhead, and could efficiently support reconfiguration and scheduler development.

  • PDF

Joint User Association and Resource Allocation of Device-to-Device Communication in Small Cell Networks

  • Gong, Wenrong;Wang, Xiaoxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.1-19
    • /
    • 2015
  • With the recent popularity of smart terminals, the demand for high-data-rate transmission is growing rapidly, which brings a new challenge for the traditional cellular networks. Both device-to-device (D2D) communication and small cells are effective to improve the transmission efficiency of local communication. In this paper, we apply D2D communication into a small cell network system (SNets) and study about the optimization problem of resource allocation for D2D communication. The optimization problem includes system scheduling and resource allocation, which is exponentially complex and the optimal solution is infeasible to achieve. Therefore, in this paper, the optimization problem is decomposed into several smaller problems and a hierarchical scheme is proposed to obtain the solution. The proposed hierarchical scheme consists of three steps: D2D communication groups formation, the estimation of sub-channels needed by each D2D communication group and specific resource allocation. From numerical simulation results, we find that the proposed resource allocation scheme is effective in improving the spectral efficiency and reducing the outage probability of D2D communication.

An intelligent planner of processing equipment for CSCW-based shop floor control in agile manufacturing

  • Kim, Hwajin;Cho, Hyunbo;Jung, Mooyoung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.185-192
    • /
    • 1995
  • A common control model used to implement computer integrated manufacturing(CIM) is based on the hierarchical decomposition of the shop floor activities, in which supervisory controllers are responsible for all the interactions among subordinates. Although the hierarchical control philosophy provides for easy understanding of complex systems, an emerging manufacturing paradigm, agile manufacturing, requires a new control structure necessary to accommodate the rapid development of a shop floor controller. This is what is called CSCW(computer supported cooperative work)-based control or component-based heterarchical control. As computing resources and communication network on the shop floor become increasingly intelligent and powerful, the new control architecture is about to come true in a modern CIM system. In this paper, CSCW-based control is adopted and investigated, in which a controller for a unit of device performs 3 main functions - planning, scheduling and execution. In this paper, attention is paid to a planning function and all the detailed planning activities for CSCW-based shop floor control are identified. Interactions with other functions are also addressed. Generally speaking, planning determines tasks to be scheduled in the future. In other words, planning analyzes process plans and transforms process plans into detailed plans adequate for shop floor control. Planning is also responsible for updating the process plan and identifying/resolving replanning activities whether they come from scheduling or execution.

  • PDF

FMS Control and Monitoring using Petri Net (Petri-Net 을 이용한 FMS 제어 및 모니터링)

  • Kim, Go-Joong;Jung, Moo-Young;Jo, Hyeon-Bo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.1
    • /
    • pp.137-151
    • /
    • 1995
  • A difficult problem in operating Flexible Manufacturing Systems (FMS) is to control the system in real-time by coordinating heterogeneous machines and integrating distributed information. The objective of the paper is to present the models and methodologies useful to resolve the difficult problem. The detailed objectives can be described in three folds. First, a hierarchical Colored and Timed Petri-Net (CTPN) is designed to control an FMS in real-time. The concerned FMS consists of a loading station, several machining cells, a material handling system, and an unloading station. Timed-transitions are used to represent the timed-events such as AGV movements between stations and cells, part machining activities in the cells. Signal places are also used to represent communication status between the host and the cell controllers. To resolve the event conflicts and scheduling problems, dispatching rules are introduced and applied. Second, an implementation methodology used to monitor and diagnose the errors occurring on the machines during system operation is proposed. Third, a Petri-Net simulator is developed to experiment with the designed control logic.

  • PDF

Scheduling Algorithm using DAG Leveling in Optical Grid Environment (옵티컬 그리드 환경에서 DAG 계층화를 통한 스케줄링 알고리즘)

  • Yoon, Wan-Oh;Lim, Hyun-Soo;Song, In-Seong;Kim, Ji-Won;Choi, Sang-Bang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.4
    • /
    • pp.71-81
    • /
    • 2010
  • In grid system, Task scheduling based on list scheduling models has showed low complexity and high efficiency in fully connected processor set environment. However, earlier schemes did not consider sufficiently the communication cost among tasks and the composition process of lightpath for communication in optical gird environment. In this thesis, we propose LSOG (Leveling Selection in Optical Grid) which sets task priority after forming a hierarchical directed acyclic graph (DAG) that is optimized in optical grid environment. To determine priorities of task assignment in the same level, proposed algorithm executes the task with biggest communication cost between itself and its predecessor. Then, it considers the shortest route for communication between tasks. This process improves communication cost in scheduling process through optimizing link resource usage in optical grid environment. We compared LSOG algorithm with conventional ELSA (Extended List Scheduling Algorithm) and SCP (Scheduled Critical Path) algorithm. We could see the enhancement in overall scheduling performance through increment in CCR value and smoothing network environment.

Two-Level Hierarchical Production Planning for a Semiconductor Probing Facility (반도체 프로브 공정에서의 2단계 계층적 생산 계획 방법 연구)

  • Bang, June-Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.4
    • /
    • pp.159-167
    • /
    • 2015
  • We consider a wafer lot transfer/release planning problem from semiconductor wafer fabrication facilities to probing facilities with the objective of minimizing the deviation of workload and total tardiness of customers' orders. Due to the complexity of the considered problem, we propose a two-level hierarchical production planning method for the lot transfer problem between two parallel facilities to obtain an executable production plan and schedule. In the higher level, the solution for the reduced mathematical model with Lagrangian relaxation method can be regarded as a coarse good lot transfer/release plan with daily time bucket, and discrete-event simulation is performed to obtain detailed lot processing schedules at the machines with a priority-rule-based scheduling method and the lot transfer/release plan is evaluated in the lower level. To evaluate the performance of the suggested planning method, we provide computational tests on the problems obtained from a set of real data and additional test scenarios in which the several levels of variations are added in the customers' demands. Results of computational tests showed that the proposed lot transfer/planning architecture generates executable plans within acceptable computational time in the real factories and the total tardiness of orders can be reduced more effectively by using more sophisticated lot transfer methods, such as considering the due date and ready times of lots associated the same order with the mathematical formulation. The proposed method may be implemented for the problem of job assignment in back-end process such as the assignment of chips to be tested from assembly facilities to final test facilities. Also, the proposed method can be improved by considering the sequence dependent setup in the probing facilities.

A Hierarchical Production Planning and Control System in a Make-to-Order Environment with Dynamic Events (동적 이벤트를 고려한 수주생산환경의 계층적 생산계획 및 통제 시스템)

  • Jang, Gil-Sang;Kim, Jae-Gyun
    • IE interfaces
    • /
    • v.14 no.1
    • /
    • pp.9-19
    • /
    • 2001
  • Production planning and control system plays an important role in manufacturing companies because it determines all production capacity planning, material procurement planning, and production scheduling which are needed in the process of producing products. Many researches on production planning and control system have been conducted for many manufacturing companies for recent decade. But, a considerable research achievement has mainly been obtained on the forecast-driven production for a make-to-stock and an assemble-to-order. The reason is that there are some hardships such as difficulties of standardizing product information, the frequent changes of design and material, and the unexpected dynamic events that influence the production of customer's order in a make-to-order or an engineering-to-order environments. By these characteristics and their complexities, some studies for production planning and control system in a make-to-order environment are presented recently. In this paper, we present the framework of the hietachical production planning and control for a make-to-order environment with dynamic events. In order to illustrate the usefulness of the proposed framework for a hietachical production planning and control, the information system for a make-to-order production was implemented with the object of the company of producing electricity transformer.

  • PDF