• 제목/요약/키워드: Scheduling Rule

검색결과 148건 처리시간 0.03초

A rule-based scheduling system for automated machining

  • Ahn, Jaekyoung
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1992년도 춘계공동학술대회 발표논문 및 초록집; 울산대학교, 울산; 01월 02일 May 1992
    • /
    • 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

  • PDF

FMS 에서의 지능제어형 생산계획을 위한 전문가 시스템 (Expert System for Intelligent Control-Based Job Scheduling in FMS)

  • 정현호;이창훈;서기성;우광방
    • 대한전기학회논문지
    • /
    • 제39권5호
    • /
    • pp.527-537
    • /
    • 1990
  • This paper describes an intelligent control-based job scheduler, named ESIJOBS, for flexible manufacturing system. In order to construct rulebase of this system, traditional rules of job scheduling in FMS are examined and evaluated. This result and the repetitional simulations with graphic monitoring system are used to form the rulebase of ESIJOBS, which is composed of three parts:six part selection rules, four machine center selection rules, and twenty-one metarules. Appropriate scheduling rule sets are selected by this rulebase and manufacturing system status. The performances of all simulations are affected by random breakdowns of major FMS components during each simulation. Six criteria are used to evaluate the performance of each scheduling. The two modes of ESIJOBS are simulated and compared with combinational 24 rule-set simulations. In this comparison ESIJOBS dominated the other rule-set simulations and showed the most excellent performance particularly in three criteria.

다수 자원제약 하에서의 프로젝트 일정계획에 관한 연구 (A Study on Project Scheduling under Multiple Resource Constraints)

  • 이정훈;김판술;문일경
    • 대한산업공학회지
    • /
    • 제36권4호
    • /
    • pp.219-229
    • /
    • 2010
  • The PERT/CPM are considered as the base procedures for the most successful project scheduling programs. Unfortunately, it is not easy to apply these procedures to real-life projects. This is due to the fact that PERT/CPM assume an infinite number of resources for each activity in project networks. Obviously, the completion time under no constraints is less than when constraints are imposed. One way of approaching this problem is to use heuristic solution techniques. In this paper, we present three heuristics; MRU (Maximum Resource Use) rule, STU (Shortest Time Use) rule, MRUP (Max Resource Use and Period) rule for allocating resources to activities of projects under multiple resource constraints. Comparisons of the project durations show that these heuristic rules are superior to AG3 rule that has been widely used in practice (Elsayed and Boucher, 1994).

공정 그룹별 Start lag을 고려한 스케쥴링 (Scheduling with regard to start lag in process group)

  • 전태준;박성호
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
    • /
    • pp.299-302
    • /
    • 1996
  • The purpose of this study is developing scheduling logic and program for machining scheduling of automobile part production line with unbalanced processing time. Three rules are developed to minimize slack and effect on other job. Fourth rule is suggested which considered weighted sum of three factors. schedule is generated totally 1, 000 times and then optimal weight parameter is selected. The program is developed to schedule situation to compare with the performance measure, total finish time of machine and total tardiness of part. As a result, the rule which considered weighted sum of three factors is effective for both measure.

  • PDF

시뮬레이션을 이용한 단공정작업의 스케줄링에 관한 연구 (A Study on the Dispatching Rules of One-process Job Using Computer Simulation)

  • 이기영;김영민
    • 대한안전경영과학회지
    • /
    • 제2권2호
    • /
    • pp.85-94
    • /
    • 2000
  • This paper deals with the selection of a proper dispatching rule for an one-process Job scheduling that follows a particular distribution of an order production. That is, it makes a distribution on an order per unit period and applies to simulation model that uses it. This study consists of two purposes either seeks adequately production scheduling using priority rule or seeks extension of the facilities that increase current production efficiency through computer simulation in scheduling.

  • PDF

Priority Assignment Procedure in Multi-Product Disassembly

  • Min, Sundong;Matsuoka, Shinobu;Muraki, Masaaki
    • Industrial Engineering and Management Systems
    • /
    • 제3권1호
    • /
    • pp.12-21
    • /
    • 2004
  • This paper investigates the design of a priority rule in a multi-product disassembly environment. Specifically, it is concerned with product scheduling by which the inventory control of disassembled parts can be incorporated into a priority rule to reduce part lead times. The part lead time consists of two components: flow time and supply delay. The primary focus of the paper is on the development of a disassembly priority rule that aims to reduce the supply delay. We propose a priority rule, called Minimum Distance (MD) rule, to improve the supply delay performance. Finally, we provide a comparative analysis on the performance of traditional rules and the new rule proposed in this paper via a simulation model.

Scheduling Tasks for a Time Sharing Computer System with a Single Processor

  • 차동완
    • 정보과학회지
    • /
    • 제5권1호
    • /
    • pp.04-10
    • /
    • 1987
  • 本 論文은 단일 processor를 가진 computer time sharing system의 運用 에 關한 것이다. 서로 다른 K 종류의 task들이 各各 獨立的이고 time-homojeneous한 Poisson分布를 따라 System에 들어 오고 있다. 또한, task 가 配當된 quantum동안 process를 받고 난후 이미 주어진 確率에 의해, 써어비스 를 完了받고 System을 離脫하기도 하고, 未完結된 경우 다른 種類의 task로 바뀌 어져 다시 process를 받기 爲해 待期한다고 한다. 이러한 여러종류의 task를 相對 로 한 time sharing model에서는 各種類의 完結에 必要한 process time의 길이에 의해 各種類의 順位(priority)가 一方的으로 決定된 것이 通例이었다. 本 硏究에서 는 各 種類의 順位를 결정하는데 있어서, 좀더 現實的인 諸條件을 반영키 위해, 各種類의 完決에 要하는 process time의 길이 뿐만 아니라, 그들의 重要度 그리고 또 緊急度까지도 고려한 새로운 Schedulign rule을 개발하였다. 또한 이 새로운 Scheduling rule에 의해 順位를 決定하는 Algorithm도 수록하였다.

전력계통의 단기 발전계획 기원용 전문가시스템 (An Expert System for Short-Term Generation Scheduling of Electric Power Systems)

  • Yu, In-Keun
    • 대한전기학회논문지
    • /
    • 제41권8호
    • /
    • pp.831-840
    • /
    • 1992
  • This paper presents an efficient short-term generation scheduling method using a rule-based expert/consulting system approach to assist electric energy system operators and planners. The expert system approach is applied to improve the Dynamic Programming(DP) based generation scheduling algorithm. In the selection procedure of the feasible combinations of generating units at each stage, automatic consulting on the manipulation of several constraints such as the minimum up time, the minimum down time and the maximum running time constraints of generating units will be performed by the expert/consulting system. In order to maximize the solution feasibility, the aforementioned constraints are controlled by a rule-based expert system, that is, instead of imposing penalty cost to those constraint violated combinations, which sometimes may become the very reason of no existing solution, several constraints will be manipulated within their flexibilities using the rules and facts that are established by domain experts. In this paper, for the purpose of implementing the consulting of several constraints during the dynamic process of generation scheduling, an expert system named STGSCS is developed. As a building tool of the expert system, C Language Integrated Production System(CLIPS) is used. The effectiveness of the proposed algorithm has been demonstrated by applying it to a model electric energy system.

  • PDF

확장된 Petri-net을 이용한 FMS의 모델링 및 스케쥴링 (Modeling and scheduling for FMS using extended petri nets)

  • 안인석;서기성;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
    • /
    • pp.488-492
    • /
    • 1991
  • This paper deals with modeling and scheduling for flexible manufacturing systems(FMS). In modeling extended Petri nets are used to describe various and complex properties. To resolve multiple conflict without predefined properties, such as part selection, machine selection, rule-based scheduling method is introduced. This structure have a capability of on-line scheduling with systematic modeling description.

  • PDF

Adaptive Scheduling in Flexible Manufacturing Systems

  • 박상찬;Narayan Raman;Michael J. Shaw
    • 한국경영과학회지
    • /
    • 제13권1호
    • /
    • pp.57-57
    • /
    • 1988
  • This paper develops an adaptive scheduling policy for flexible manufacturing systems. The inductive learning methodology used for constructing this state-dependent scheduling policy provides and understanding of the relative importance of the various system parameters in determining the appropriate scheduling rule. Experimental studies indicated the superiority of the suggested approach over the alternative approach involving the repeated application of a single scheduling rule for randomly generated test problems as well as a real system, and under both stationary and nonstationary conditions. In particular, its relative performance improves further when there are frequent disruptions, and when disruptions are caused by the introduction of tiiight due date jobs, one of the most common surces of disruptions in most manufacturing systems.