• Title/Summary/Keyword: Scheduling System

Search Result 2,159, Processing Time 0.029 seconds

Assessment of the CO2 Emission Considering the Generator Maintenance Scheduling (발전기보수유지계획을 고려한 CO2배출량의 추정)

  • Jeon, Dong-Hoon;Park, Jeong-Je;Oh, Tae-Gon;Cho, Kyeong-Hee;Choi, Jae-Seok;Baek, Ung-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.9
    • /
    • pp.1507-1513
    • /
    • 2010
  • The $CO_2$ emission can be decreased due to freedom of generator maintenance scheduling(GMS). This paper proposes assessment of $CO_2$ emission considering generator maintenance scheduling(GMS) and evaluates effect of the GMS on $CO_2$ emission. And also, this paper assesses the $CO_2$ emission and the probabilistic production cost simulation of nuclear and thermal power generators considering operation of hydro and pumped generator. The minimum reliability criterion level satisfied production cost minimization function model is used in this paper. The practicality and effectiveness of the proposed approach are demonstrated by simulation studies for a real size power system in Korea in 2010.

A Study on the Application of Scheduling & Planning for Nuclear R &D Projects : Cas of LMR Project (원자력연구개발사업의 공정관리 적용 사례 연구)

  • 한도희
    • Journal of Korea Technology Innovation Society
    • /
    • v.2 no.3
    • /
    • pp.118-128
    • /
    • 1999
  • This study attempts to provide an efficient method for managing the Nuclear R&D projects. It should be noted that the technology and experiences to develop a well-balanced plan and mon-itoring for the R&D project are not yet well established when compared with the commercial con-structionand engineering projects. This study recommends that the R&D project manager utilize the scheduling techniques to establish an integral management system taking in to account the un-certainties in the research environment. Based upon the results of a case study for the Liquid Metal Reactor Design Technology Development Project which is led by the KAERI this study also con-firms that it is possible to run the national nuclear R&D projects with the Scheduling & Planning.

  • PDF

A Heuristic Scheduling Algorithm for Transformer Winding Process with Non-identical Parallel Machines (이종병렬기계로 구성된 변압기 권선공정의 생산일정계획)

  • 박창권;장길상;이동현
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.26 no.2
    • /
    • pp.35-41
    • /
    • 2003
  • This paper proposes a heuristic scheduling algorithm to satisfy the customer's due date in the production process under make to order environment. The goal is to achieve the machine scheduling in the transformer winding process, in which consists of parallel machines with different machine performances. The winding is important production process in the transformer manufacturing company. The efficiency of the winding machines is different according to the voltage capacity and the winding type. This paper introduces a heuristic approach in the transformer winding process where the objective function is to minimize the total tardiness of jobs over due dates. The numerical experiment is illustrated to evaluate the performance.

A Two-Machine Flowshop Scheduling with Outsourcing Strategy Allowed (아웃소싱 전략을 활용하는 두 단계 흐름생산라인의 일정계획)

  • Lee, Ik Sun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.3
    • /
    • pp.113-121
    • /
    • 2014
  • This paper considers a scheduling problem in a two-machine flowshop with outsourcing strategy incorporated. The jobs can be either processed in the first machine or outsourced to outside subcontractors. This paper wants to determine which jobs to be processed in-house and which jobs to be outsourced. If any job is decided to be outsourced, then an additional outsourcing cost is charged The objective of this paper is to minimize the sum of scheduling cost and outsourcing cost under a budget constraint. At first this paper characterizes some solution properties, and then it derives solution procedure including DP (Dynamic Programming) and B&B (Branch-and-Bound) algorithms and a greedy-type heuristic. Finally the performance of the algorithms are evaluated with some numerical tests.

Periodic and Real-Time Aperiodic Task Scheduling Algorithm based on Topological Sort and Residual Time (위상 정렬과 여유 시간 기반 주기 및 실시간 비주기 태스크 스케줄링 알고리즘)

  • Kim, Si-Wan;Park, Hong-Seong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.4
    • /
    • pp.302-307
    • /
    • 2012
  • Real-time systems perform periodic tasks and real-time aperiodic tasks such as alarm processing. Especially the periodic tasks included in control systems such as robots have precedence relationships among them. This paper proposes a new scheduling algorithm based on topological sort and residual time. The precedence relationships among periodic tasks are translated to the priorities of the tasks using topological sort algorithm. During the execution of the system the proposed scheduling algorithm decides on whether or not a newly arrived real-time aperiodic task is accepted based on residual time whenever the aperiodic task such as alarm is arrived. The proposed algorithm is validated using examples.

Optimal Communication Channel Scheduling for Remote Control of Lead Vehicle in a Platoon (군집 선행차량의 원격제어를 위한 통신 채널의 최적 스케줄링)

  • 황태현;최재원
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.12
    • /
    • pp.969-976
    • /
    • 2003
  • A remote control strategy for vehicles in Intelligent Vehicle Highway System (IVHS) is considered. An optimal scheduling of a limited communication channel is proposed for lead vehicle control in a platoon. The optimal scheduling problem is to find the optimal communication sequence that minimizes the cost obtained inherently by an optimal control without the communication constraint. In this paper, the PID control law which guarantees the string stability is used for the lead vehicle control. The fact that the PID control law is equivalent to the approximately linear quadratic tracker allows to obtain the performance measure to find an optimal sequence. Simulations are conducted with five maneuvering platoons to evaluate the optimality of the obtained sequence.

Multiagent Scheduling of a Single Machine Under Public Information (공적 정보하에서 단일 설비의 다중 에이전트 스케줄링)

  • Lee, Yong-Kyu;Choi, Yoo-Seong;Jeong, In-Jae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.1
    • /
    • pp.72-78
    • /
    • 2009
  • This paper considers a multiagent scheduling problem under public information where a machine is shared by multiple agents. Each agent has a local objective among the minimization of total completion time and the minimization of maximum. In this problem, it is assumed that scheduling information is public. Therefore an agent can access to complete information of other agents and pursue efficient schedules in a centralized manner. We propose an enumeration scheme to find Pareto optimal schedules and a multiobjective genetic algorithm as a heuristic approach. Experimental results indicate that the proposed genetic algorithm yields close-to Pareto optimal solution under a variety of experimental conditions.

An Algorithm for Iterative Detection and Decoding MIMO-OFDM HARQ with Antenna Scheduling

  • Kim, Kyoo-Hyun;Kang, Seung-Won;Mohaisen, Manar;Chang, Kyung-Hi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.4
    • /
    • pp.194-208
    • /
    • 2008
  • In this paper, a multiple-input-multiple-output (MIMO) hybrid-automatic repeat request (HARQ) algorithm with antenna scheduling is proposed. It retransmits the packet using scheduled transmit antennas according to the state of the communication link, instead of retransmitting the packet via the same antennas. As a result, a combination of conventional HARQ systems, viz. chase combining (CC) and incremental redundancy (IR) are used to achieve better performance and lower redundancy. The proposed MIMO-OFDM HARQ system with antenna scheduling is shown to be superior to conventional MIMO HARQ systems, due to its spatial diversity gain.

Scheduling Algorithm for Fairness of Network Resources on Large Scale ATM Networks (광역 ATM망에서 망 자원 활용의 공평성을 위한 스케줄링 알고리즘)

  • 이은주
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.9
    • /
    • pp.1225-1232
    • /
    • 2001
  • In this paper, we investigate the scheduling algorithm of router system for Internet services on large scale ATM networks based on the quality-of-service(QoS) level of the input source traffics. We suggest an approprite scheduling algorithm in order to satisfy their QoS requirements. For this purpose, we first study the service requirements of the multiplexer in Internet. Second, we suggest functional architecture of the multiplexer for real time services and the scheduling algorithm to satisfy various QoS requirements. Finally, the performance measures of interest, namely steady-state average delay time and fairness of network resources, are discussed by simulation results.

  • PDF

Multi-Stage Group Scheduling with Dependent Setup Time (종속적(從屬的)인 준비시간을 갖는 다단계공정(多段階工程)에서의 그룹스케듈링 해법(解法))

  • Song, Yeong-U;No, In-Gyu;Kim, Man-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.11 no.2
    • /
    • pp.75-85
    • /
    • 1985
  • The application of GT results in the mass production effect to multi-product, small lot-sized production. Group scheduling, which is operations scheduling based on the GT concept, is analyzed in a multistage manufacturing system. But the research has been limited in independent setup time models. A heuristic algorithm has been developed to minimize the mean flow time when setup times are dependent to sequence of group in multistage. For evaluation of the heuristic algorithm, the solution of heuristic algorithm is compared with that of random scheduling. The result of comparison indicates that the proposed heuristic algorithm provides good solutions with relatively fewer computational effort.

  • PDF