• Title/Summary/Keyword: Order Scheduling

Search Result 845, Processing Time 0.03 seconds

A Process-net based System for the Integration of Process Planning and Operation Scheduling (동정 네트 모델에 의한 공정 계획과 일정 계획의 통합)

  • 박지형;강민형;노형민
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.04a
    • /
    • pp.445-449
    • /
    • 1997
  • In order to provide a manufacturing system with efficiency and flexibility to cope with the changes in shop floor status, the integration of process planning and operations scheduling is required. In this paper,an integrated system of process planning and operations scheduling based on the concept of process net model is presented. The process net model includes the alternative process plans. The integrated system is applied for prismatic parts.

  • PDF

Integration of Process Planning and Operations Scheduling by Process Net Model and Genetic Algorithm (공정 네트 모델과 유전 알고리즘에 의한 공정 계획과 일정 계획의 통합)

  • 박지형;강민형;노형민
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.3
    • /
    • pp.82-87
    • /
    • 1998
  • In order to provide a manufacturing system with efficiency and flexibility to cope with the changes in shop floor status, the integration of process planning and operations scheduling is required. In this paper, an integrated system of process planning and operations scheduling based on the concept of process net model and genetic algorithm is suggested. The process net model includes the alternative process plans. The integrated system is applied for prismatic parts.

  • PDF

FUZZY Logic-Based Fast Gain Scheduling Control Using Fuzzy Preprocessor

  • Lee, Seon-Ho;Kim, Sung-Gyu;Zeungnam Bien
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.73-76
    • /
    • 1997
  • This paper proposes the fuzzy logic-based fast gain scheduling(FFGS) controller for regulation problem in nonlinear systems. It utilizes which reflects the derivative information on the original scheduling variable in order to achieve better performance than the existents. Moreover, we apply the proposed control scheme to control active suspension systems with nonlinear components.

  • PDF

A Study on Rail Crane Scheduling Problem at Rail Terminal (철송 크레인 일정계획문제에 관한 연구)

  • Kim, Kwang-Tae;Kim, Kyung-Min;Kim, Dong-Hee
    • Proceedings of the KSR Conference
    • /
    • 2011.05a
    • /
    • pp.269-276
    • /
    • 2011
  • This paper considers the rail crane scheduling problem with minimizing the sum of the range of order completion time and make-span of rail crane simultaneously. The range of order completion time implies the difference between the maximum of completion time and minimum of start time. Make-span refers to the time when all the tasks are completed. At a rail terminal, logistics companies wish to concentrate on their task of loading and unloading container on/from rail freight train at a time in order to increase the efficiency of their equipment such as reach stacker. In other words, they want to reduce the range of their order completion time. As a part of efforts to meet the needs, the crane schedule is rearranged based on worker's experience. We formulate the problem as a mixed integer program. To validate the effectiveness of the model, computational experiments were conducted using a set of data randomly generated.

  • PDF

Performance Evaluation of Scheduling Rules Considering Order Change Using Simulation (주문 변화를 반영하는 스케줄링 규칙에 대한 시뮬레이션을 이용한 성능 평가)

  • 박종관;이영훈
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.3
    • /
    • pp.13-26
    • /
    • 2000
  • The scheduling rule for the fabrication process of the semiconductor manufacturing is suggested and tested on the simulation system which was developed based on the model to represent the main characteristics of wafer flows. The proper scheduling policies are necessary to meet the order change in the supply chain management. It was shown that the suggested rules which consider the wafer balance and the due date of the order, give good performances for the cycle time reduction and the rate of meeting due date as well. Also they are robust in the sense that performances are stable regardless of the order change rate and the input policies.

  • PDF

Design of a Coordinating Mechanism for Multi-Level Scheduling Systems in Supply Chain

  • Lee, Jung-Seung;Kim, Soo
    • Journal of Information Technology Applications and Management
    • /
    • v.19 no.1
    • /
    • pp.37-46
    • /
    • 2012
  • The scheduling problem of large products like ships, airplanes, space shuttles, assembled constructions, and automobiles is very complex in nature. To reduce inherent computational complexity, we often design scheduling systems that the original problem is decomposed into small sub-problems, which are scheduled independently and integrated into the original one. Moreover, the steep growth of communication technology and logistics makes it possible to produce a lot of multi-nation corporation by which products are produced across more than one plant. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. In this research, we suggest an agent-based coordinating mechanism for multi-level scheduling systems in supply chain. For design of a general coordination mechanism, at first, we propose a grammar to define individual scheduling agents which are responsible to their own plants, and a meta-level coordination agent which is engaged to supervise individual scheduling agents. Second, we suggest scheduling agent communication protocols for each scheduling agent topology which is classified according to the system architecture, existence of coordinator, and direction of coordination. We also suggest a scheduling agent communication language which consists of three layers : Agent Communication Layer, Scheduling Coordination Layer, Industry-specific Layer. Finally, in order to improve the efficiency of communication among scheduling agents we suggest a rough capacity coordination model which supports to monitor participating agents and analyze the status of them. With this coordination mechanism, we can easily model coordination processes of multiple scheduling systems. In the future, we will apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly-plant-scheduling agents, and a meta-level coordination agent. A series of experiment using the real-world data will be performed to examine this mechanism.

Development of Agent-based Platform for Coordinated Scheduling in Global Supply Chain (글로벌 공급사슬에서 경쟁협력 스케줄링을 위한 에이전트 기반 플랫폼 구축)

  • Lee, Jung-Seung;Choi, Seong-Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.213-226
    • /
    • 2011
  • In global supply chain, the scheduling problems of large products such as ships, airplanes, space shuttles, assembled constructions, and/or automobiles are complicated by nature. New scheduling systems are often developed in order to reduce inherent computational complexity. As a result, a problem can be decomposed into small sub-problems, problems that contain independently small scheduling systems integrating into the initial problem. As one of the authors experienced, DAS (Daewoo Shipbuilding Scheduling System) has adopted a two-layered hierarchical architecture. In the hierarchical architecture, individual scheduling systems composed of a high-level dock scheduler, DAS-ERECT and low-level assembly plant schedulers, DAS-PBS, DAS-3DS, DAS-NPS, and DAS-A7 try to search the best schedules under their own constraints. Moreover, the steep growth of communication technology and logistics enables it to introduce distributed multi-nation production plants by which different parts are produced by designated plants. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. No standard coordination mechanism of multiple scheduling systems exists, even though there are various scheduling systems existing in the area of scheduling research. Previous research regarding the coordination mechanism has mainly focused on external conversation without capacity model. Prior research has heavily focuses on agent-based coordination in the area of agent research. Yet, no scheduling domain has been developed. Previous research regarding the agent-based scheduling has paid its ample attention to internal coordination of scheduling process, a process that has not been efficient. In this study, we suggest a general framework for agent-based coordination of multiple scheduling systems in global supply chain. The purpose of this study was to design a standard coordination mechanism. To do so, we first define an individual scheduling agent responsible for their own plants and a meta-level coordination agent involved with each individual scheduling agent. We then suggest variables and values describing the individual scheduling agent and meta-level coordination agent. These variables and values are represented by Backus-Naur Form. Second, we suggest scheduling agent communication protocols for each scheduling agent topology classified into the system architectures, existence or nonexistence of coordinator, and directions of coordination. If there was a coordinating agent, an individual scheduling agent could communicate with another individual agent indirectly through the coordinator. On the other hand, if there was not any coordinating agent existing, an individual scheduling agent should communicate with another individual agent directly. To apply agent communication language specifically to the scheduling coordination domain, we had to additionally define an inner language, a language that suitably expresses scheduling coordination. A scheduling agent communication language is devised for the communication among agents independent of domain. We adopt three message layers which are ACL layer, scheduling coordination layer, and industry-specific layer. The ACL layer is a domain independent outer language layer. The scheduling coordination layer has terms necessary for scheduling coordination. The industry-specific layer expresses the industry specification. Third, in order to improve the efficiency of communication among scheduling agents and avoid possible infinite loops, we suggest a look-ahead load balancing model which supports to monitor participating agents and to analyze the status of the agents. To build the look-ahead load balancing model, the status of participating agents should be monitored. Most of all, the amount of sharing information should be considered. If complete information is collected, updating and maintenance cost of sharing information will be increasing although the frequency of communication will be decreasing. Therefore the level of detail and updating period of sharing information should be decided contingently. By means of this standard coordination mechanism, we can easily model coordination processes of multiple scheduling systems into supply chain. Finally, we apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly- plant-scheduling agents, and a meta-level coordination agent. A series of experiments using the real world data are used to empirically examine this mechanism. The results of this study show that the effect of agent-based platform on coordinated scheduling is evident in terms of the number of tardy jobs, tardiness, and makespan.

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.

Packet Scheduling Algorithm Considering Maximum Delay Tolerance for HSDPA System

  • Hur, Soojung;Jakhongil, Narzullaev;Park, Yong-Wan
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.8 no.6
    • /
    • pp.311-318
    • /
    • 2013
  • In this paper, we consider a new packet scheduling algorithm for real-time traffic in the HSDPA system that has been introduced for the WCDMA system, in order to provide high transmission rates. The objective of the design is to meet the maximum tolerable delay and consider channel assignment based on the received SIR for real-time traffic users. The proposed scheduling algorithm shows that the users are ranked by the ratios of the bits in the buffer to the residual time for transmission as priority order; then the ranked users are assigned certain number of channels based on the SIR value table. The simulation results show that the proposed algorithm can provide a lower packet drop rate, and satisfy real time quality of service (QoS) requirements.

Production Scheduling employing ERP in the make-to-order manufacturing system (주문생산 방식하에서 ERP를 응용한 일정계획 수립 사례 연구)

  • Lee, Soon-Ku;Lee, Young-Hoon
    • IE interfaces
    • /
    • v.12 no.3
    • /
    • pp.424-436
    • /
    • 1999
  • Due to environmental change in market, delivery satisfaction to customers and reduction of lead time are critical in the make-to-order manufacturing system. A case of production scheduling process restructuring is studied for one company which employed ERP system. Based on the standard module ERP package provided, they modified and added several functions for their specific processes, and implemented it in production scheduling. The ratio of delivery satisfaction has been improved from 51.1% to 60.8%, and manufacturing lead time has been reduced from 43 days to 30 days in average during 10 months. Moreover, they achieved several side effects such as real time production scheduling and workload analysis, information sharing over all departments, and improving flexibility in receiving orders.

  • PDF