• Journal of the Korea Society for Simulation
• /
• v.5 no.2
• /
• pp.1-12
• /
• 1996

Utilizing the simulation approaches, the dynamic production scheduling system FOLS(Flexible flowshop On-Line Simulation) is developed under the flexible flowshop environment. When an interruption such as machine failure/recovery is occurred at the shop floor, the FOLS system performs evaluations for job selection rule oriented alternatives, and generates a dynamic production schedule based on the collected current shop floor data. For the case study, the FOLS system is applied to the printed circuit card assembly(PCCA) line and simulation results are reported.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.7
• /
• pp.294-301
• /
• 2002

A new dynamic scheduling algorithm is proposed for CAN-based real-time system in this paper. The proposed algorithm is extended from an existing EDS(Earliest Deadline Scheduling) approach having a solution to the priority inversion. Using the proposed algorithm, the available bandwidth of network media can be checked dynamically, and consequently arbitration delay causing the miss of deadline can be avoided. Also, non-real time messages can be processed with their bandwidth allocation. Full network utilization and real-time transmission feasibility can be achieved through the algorithm. To evaluate the performance of algorithm, two simulation tests are performed. The first one is transmission data measurement per minute for periodic messages and the second one is feasibility in the system with both periodic messages and non-real time message.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1111-1116
• /
• 1993

In this study, we discuss the design of the expert system for the scheduling of the FMC(Flexible Manufacturing Cell) consisting of the several versatile machines. Due to the NP property, the scheduling problem of several machine FMC is very complex task. Thus we proposed the two heuritstic shceduling algorithms for solving the problem and constituted the algorithm based of solving the problem and constituted the algorithm base of ISS(Intelligent Scheduling System) using them. By the rules in the rule base, the best alternative among various algorithms in algorithm base is selected and applied in controlling the FMC. To show the efficiency of ISS, the scheduling output of ISS and the existent dynamic dispatching rule were tested and compared. The results indicate that the ISS is superior to the existent dynamic dispatching rules in various performance indexes.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.2
• /
• pp.17-23
• /
• 2004

Changes in manufacturing system are those that occur during production and cause the systems to behave unpredictably. So scheduling problem in this dynamic Industrial environments is very complex. The main concept of this dissertation is to continuously monitor a manufacturing system status(Rate of Prior Job, Rate of Large Job, Rate of Shortest due date Job, Job Interval Time) and detect or predict a change so that scheduling system will react by modifying production schedule(dispaching rule) to lessen the effects of this change.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.3
• /
• pp.31-40
• /
• 1993

This paper deals with the modeling and scheduling for FMC(Flexible Manufacturing Cells). The FMC system composed of unit or multi cells is capable of improving productivity with flexibility for machine. However, the properties of multiple jobs and various alternatives results in tne dynamic states which make system management very complex. The extended Peti nets are used to represent for complex properties of FMC which performs short-term scheduling and dynamic operational scheduling. The hierarchical control structure and integlligent scheduling through expert module are adopted for efficiency of FMC operations. The computer simulation reveals that intelligent scheduling method is better than heuristics in various performance indices.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2369-2373
• /
• 2001

Usually the static scheduling algorithms such as DMS (Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm haying a solution to the priority inversion. In the proposed algorithm, the available bandwidth of network media can be checked dynamically by all nodes. Through the algorithm, arbitration delay causing the miss of their deadline can be avoided in advance. Also non real-time messages can be processed with their bandwidth allocation. The proposed algorithm can achieve full network utilization and enhance aperiodic responsiveness, still guaranteeing the transmission of periodic messages.

• IE interfaces
• /
• v.12 no.3
• /
• pp.362-373
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling (RCDMPS) is intended to schedule activities of two or more projects sequentially arriving at die shop under restricted resources. The aim of this paper is to develop a new problem solving method for RCDMPS to make an effect schedule based by constraint programming. The constraint-based scheduling method employs ILOG Solver which is C++ constraint reasoning library for solving complex resource management problems and ILOG Schedule which is a add-on library to ILOG Solver dedicated to solving scheduling problems. And this method interfaces with ILOG Views so that the result of scheduling displays with Gantt chart. The scheduling method suggested in this paper was applied to a company scheduling problem and compared with the other heuristic methods, and then it shows that the new scheduling system has more preference.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.60.3-60
• /
• 2001

Usually the static scheduling algorithms such as DMS(Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm having a solution to the priority inverstion ....

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.249-257
• /
• 1992

An automated machining system involves concurrent use of manufacturing resources, alternative process plans, and flexible routings. High investment in the installation of automated facilities requires an efficient scheduling system that is able to allocate the resources specified for operations over a scheduling horizon. The primary emphasis of this paper is to generate schedules that accurately reflect details of the automated environment and the objectives stated for the system. In this paper, a scheduling algorithm for automated machining is presented. Using the previous simulation research for this topic, a rule-based scheduling system is constructed. An architecture for an intelligent scheduling system is proposed, and the system has a high potential to provide efficient schedules based on the task-specific knowledge for the dynamic scheduling environment

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.5
• /
• pp.651-657
• /
• 1998

In this study, an intelligent scheduling with hybrid architecture, which integrates expert system and neural network, is proposed. Neural network is trained with the data acquired from simulation model of FMC to obtain the knowledge about the relationship between the state of the FMC and its best dispatching rule. Expert system controls the scheduling of FMC by integrating the output of neural network, the states of FMS, and user input. By applying the hybrid system to a scheduling problem, the human knowledge on scheduling and the generation of non-logical knowledge by machine teaming, can be processed in one scheduler. The computer simulation shows that comparing with MST(Minimum Slack Time), there is a little increment in tardness, 5% growth in flow time. And at breakdown, tardness is not increased by expert system comparing with EDD(Earliest Due Date).