• Title/Summary/Keyword: scheduling

Search Result 4,863, Processing Time 0.025 seconds

Design of Scheduling System for Flexible Manufacturing Cells (FMC에서의 일정계획 시스템의 설계)

  • 신대혁;이상완
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.17 no.32
    • /
    • pp.63-71
    • /
    • 1994
  • The purpose of this paper is to describe an effective cell scheduling system for flexible manufacturing cells. Based on the FMC characteristics, cell scheduling can be defined as a dynamic modified flow shop working in a real-time system. This paper attempt to find the optimal cell scheduling when minimizing the mean flow time for n-job/m-machine problems in static and dynamic environments. Real-time scheduling in an FMC environment requires rapid computation of the schedule.

  • PDF

A Scheduling Technique for Pipelined Datapath Synthesis (파이프라인형 데이타패스 합성을 위한 스케쥴링 기법)

  • 이근만;임인칠
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.4
    • /
    • pp.74-82
    • /
    • 1992
  • This paper deals with the scheduling problems, which are the most important subtask in High-level Synthesis. ILP(integer linear programming) formulations are used as a scheduling problem approach.For practical application to digital system design, we have concentrated our attentions on pipelined datapath scheduling. For experiment results, we choose the 5-th order digital wave filter as a benchmark and do the schedule. Finally, we can obtain better and near-optimal scheduling results.

  • PDF

Development of the Pre-Dispatch Scheduling Algorithm in the Competitive Electricity Market (경쟁적 전력시장 하에서의 선행급전계획 알고리즘 개발에 관한 연구)

  • Chung, Kooh-Hyung;Kang, Dang-Joo;Kim, Bal-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.2
    • /
    • pp.260-267
    • /
    • 2007
  • Systematic studies on the dispatch scheduling algorithm can enhance the efficiency of electricity market operation. In addition, as the dispatching policies in competitive electricity markets directly affect the market participants' profits, the dispatch scheduling procedure should be reasonable, systematic, and transparent. In this paper, we propose an unconstrained/constrained pre-dispatch scheduling algorithm and develop corresponding programs applicable to wholesale electricity markets.

A Scheduling Strategy for Reducing Set-up Time and Work-In-Process in PCB Assembly Line (PCB조립 라인의 준비 시간 단축 및 재공품 감소를 위한 스케줄링 전략)

  • 이영해;김덕한;전성진
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.1
    • /
    • pp.25-49
    • /
    • 1997
  • Printed circuit board (PCB) assembly line configuration is characterized by very long set-up times and high work in process (WIP) inventory level. The scheduling method can significantly reduce the set-up times and WIP inventory level. Greedy sequence dependent scheduling (GSDS) method is proposed based on the current methods. The proposed method is compared with the current method in terms of three performance measures: line throughput, average WIP inventory level, and implementation complexity.

  • PDF

Solution of the Resource Constrained Project Scheduling Problem on the Foundation of a Term-Based Approach (Term-Based Approach를 기초로한 자원제한프로젝트스케줄링 문제의 해결)

  • Kim, Pok-Son
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.2
    • /
    • pp.218-224
    • /
    • 2014
  • The logic-based scheduling language RCPSV may be used to model resource-constrained project scheduling problems with variants for minimizing the project completion time. A diagram-based, nonredundant enumeration algorithm for the RCPSV-problem is proposed and the correctness of the algorithm is proved.

Maintenance Scheduling using a Genetic Algorithm with New Crossover Operators (유전알고리즘을 이용한 발전계통의 보수계획 수립)

  • Jung, Jung-Won;Kim, Jung-Ik
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.5
    • /
    • pp.545-552
    • /
    • 1999
  • The Maintenance scheduling is one of the mid-term scheduling problems systems. There have been many methods for this problem, but there is no effective way to treat all the generators simultaneously. In this paper, we apply a genetic algorithm(GA) to the maintenance scheduling problem. We proposed new crossover operators(BOX type crossover) to improve searching ability of GA. Satisfactory results are obtained by GA with the proposed corssover operators.

  • PDF

A Study on Critical Ratio Scheduling for Determining the Relative Priority (상대적(相對的) 작업우선순위(作業優先順位) 결정(決定)을 위한 긴급율법(緊急率法)에 관한 사례연구(事例硏究))

  • Choe, Chang-Ho
    • Journal of Korean Society for Quality Management
    • /
    • v.15 no.2
    • /
    • pp.74-81
    • /
    • 1987
  • The purpose of this paper is to find out the relative priority among the queueing products for next operation. Critical ratio scheduling is a technique for use in production scheduling to establish and maintain relative priority among the jobs. The relative priority is based on a ratio of when the completed job is required and how much time is required to complete it. A numerical example of "D" company is solved. Jobs are classified into 3 categories; the behind scheduling jobs, the on time jobs and the ahead scheduling jobs.

  • PDF

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

  • 안인석;서기성;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • 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

Development of PC-based PVC scheduling system connected with ERP system

  • Kang, Min-Gu;Kang, Soo-Kil;Lee, Ho-Kyung;Park, Sun-Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.945-949
    • /
    • 2004
  • These days there are so many scheduling systems or softwares. But only few scheduling systems have succeeded in the market. In spite of powerful engine and functions, those systems have difficulties to be applied in real processes. In real processes, there are various constraints caused by physical or systematical environments of plants. Those constraints are too many to be handled in the system. This problem makes it difficult for the system to represent the details of processes. In order to resolve this problem, we have developed a specialized scheduling system for a target process. The system could be developed by the experts for target process and researchers for scheduling. In this study, a scheduling system for PVC process has been developed as an MILP (Mixed integer linear programming) model and coded in $Fortran^{TM}$. The scheduling system has been applied to two processes, which have different characteristics. Simulation results indicate that the profit of the target process can be increased by about 5% by implementing the scheduling system.

  • PDF

Group Scheduling for Efficient Channel Utilization in Optical Burst Switched Networks (OBS 네트워크의 효율적 채널 이용을 위한 그룹 스케줄링 방식)

  • 신종덕
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.51-58
    • /
    • 2003
  • In this paper, we propose a group scheduling scheme to efficiently utilize network resources for core nodes in optical burst switching networks. This scheme schedules multiple bursts utilizing an interval graph to obtain the maximum stable set using the information such as arrival times and burst lengths from the collected header packets. Simultaneous scheduling of multiple bursts in a scheduling window results in lower burst loss probability and increased channel utilization than those proposed previously using one-to-one mapping. Simulation results for both cases of variable and fixed burst sizes show that the group scheduling scheme is better than the immediate scheduling, so called Latest Available Unused Channel with Void Filling, scheme in both performance metrics above mentioned.