• Title/Summary/Keyword: Space Scheduling

Search Result 213, Processing Time 0.023 seconds

Energy Efficient Transmit and Receive Strategy for Green Communications

  • Oh, Changyoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.4
    • /
    • pp.25-30
    • /
    • 2016
  • We consider energy efficient transmit and receive strategy for a delay sensitive data. More specifically, we investigate an energy optimum scheduling characteristics for the 2 user interference channel where each user interferes to each other. First, we determine the optimum transmission rate region each individual user may have for optimum transmission. Next, we consider the optimum transmission region of two users together. Shortest path algorithm can be used for further reduction of search space. Eventually, we can reduce computational complexity. We then examine the performance of the optimum transmission strategy for various system environments.

Scheduling in Flexible Manufacturing System with Flow Type (흐름작업장 형태를 따르는 유연 생산시스템에서의 일정계획)

  • 장석화
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.14 no.24
    • /
    • pp.97-103
    • /
    • 1991
  • This paper deals with a scheduling problem with the objective of maximizing the throughput rate in flexible manufacturing system with shop type. Manufacturing system is consisted of multi-stage in series. All kinds of parts are processed in same in processing time. No buffer space is allowed between stages, and no part waiting is allowed in each stage. Part flow control method for determining the optimal production sequence of all parts and the production starting time of each part is proposed.

  • PDF

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.

DEEP-South: Automated Scheduler and Data Pipeline

  • Yim, Hong-Suh;Kim, Myung-Jin;Roh, Dong-Goo;Park, Jintae;Moon, Hong-Kyu;Choi, Young-Jun;Bae, Young-Ho;Lee, Hee-Jae;Oh, Young-Seok
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.41 no.1
    • /
    • pp.54.3-55
    • /
    • 2016
  • DEEP-South Scheduling and Data reduction System (DS SDS) consists of two separate software subsystems: Headquarters (HQ) at Korea Astronomy and Space Science Institute (KASI), and SDS Data Reduction (DR) at Korea Institute of Science and Technology Information (KISTI). HQ runs the DS Scheduling System (DSS), DS database (DB), and Control and Monitoring (C&M) designed to monitor and manage overall SDS actions. DR hosts the Moving Object Detection Program (MODP), Asteroid Spin Analysis Package (ASAP) and Data Reduction Control & Monitor (DRCM). MODP and ASAP conduct data analysis while DRCM checks if they are working properly. The functions of SDS is three-fold: (1) DSS plans schedules for three KMTNet stations, (2) DR performs data analysis, and (3) C&M checks whether DSS and DR function properly. DSS prepares a list of targets, aids users in deciding observation priority, calculates exposure time, schedules nightly runs, and archives data using Database Management System (DBMS). MODP is designed to discover moving objects on CCD images, while ASAP performs photometry and reconstructs their lightcurves. Based on ASAP lightcurve analysis and/or MODP astrometry, DSS schedules follow-up runs to be conducted with a part of, or three KMTNet telescopes.

  • PDF

An Implementation of YK2 Cipher System for Electronic Commerce Security (전자상거래 보안을 위한 YK2 암호시스템의 구현)

  • 서장원
    • The Journal of Society for e-Business Studies
    • /
    • v.6 no.1
    • /
    • pp.17-33
    • /
    • 2001
  • EC(Electronic Commerce) which is done on the virtual space through Internet has strong point like independence from time and space. On the contrary, it also has weak point like security problem because anybody can access easily to the system due to open network attribute of Internet, Therefore, we need the solutions that protect the EC security problem for safe and useful EC activity. One of these solutions is the implementation of strong cipher system. YK2(Young Ku King) cipher system proposed in this paper is good solution for the EC security and it overcome the limit of current block cipher system using 128 bits key length for input, output, encryption key and 32 rounds. Moreover, it is designed for the increase of time complexity by adapting more complex design for key scheduling algorithm regarded as one of important element effected to encryption.

  • PDF

Technical Papers : Development of KOMPSAT-1 Scheduling & Automatic Command Plan Generator ( KSCG ) (기술논문 : 다목적 실용위성 1 호의 임무계획 및 자동 명령계획표 생성기 개발)

  • Kim,Hae-Dong;Choe,Hae-Jin;Kim,Eun-Gyu
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.30 no.1
    • /
    • pp.139-146
    • /
    • 2002
  • This paper describes the devlopment and implementation for the KOMPSAT-1 scheduling & automatic command plan generator(KSCG). Some problems in mission planning and command planning had occurred using the mission & command planning s/w in MAPS(Missin Analysis and Planning Subsystem) during the LEOP(Launch & Early Orbit Phase) & early normal mission phase due to lots of manual input process and non-automatic process. Therefore, the more mission operations for KOMPSAT-1. In order to prevent the development of new one(KSCG) which should reduce the manual process and generate automatically the command plan has been needed. As a result, the mission operations of KOMPSAT-1 has greatly became stable and more effient.

Cross-Layer Cooperative Scheduling Scheme for Multi-channel Hybrid Ubiquitous Sensor Networks

  • Zhong, Yingji;Yang, Qinghai;Kwak, Kyung-Sup;Yuan, Dongfeng
    • ETRI Journal
    • /
    • v.30 no.5
    • /
    • pp.663-673
    • /
    • 2008
  • The multi-scenario topology of multi-channel hybrid ubiquitous sensor networks (USNs) is studied and a novel link auto-diversity cross-layer cooperative scheduling scheme is proposed in this paper. The proposed scheme integrates the attributes of the new performance evaluation link auto-diversity air-time metric and the topology space in the given multi-scenario. The proposed scheme is compared with other schemes, and its superiority is demonstrated through simulations. The simulation results show that relative energy consumption, link reception probability, and end-to-end blocking probability are improved. The addressing ratio of success with unchanged parameters and external information can be increased. The network can tolerate more hops to support reliable transportation when the proposed scheme is implemented. Moreover, the scheme can make the network stable. Therefore, the proposed scheme can enhance the average rate performance of the hybrid USN and stabilize the outage probability.

  • PDF

Development of a Block Assembly Scheduling System for Shipbuilding Company (고정정반 블록조립 작업장의 일정계획 시스템 개발)

  • Koh, Shie-Gheun;Park, Ju-Chull;Choi, Yong-Sun;Joo, Chul-Min
    • IE interfaces
    • /
    • v.12 no.4
    • /
    • pp.586-594
    • /
    • 1999
  • This paper introduces a production scheduling system for the block assembly shop in a shipbuilding company. We are to make a schedule for the assembly shop and related subassembly production shop. The objectives of the scheduling system are balancing of the workload of the subassembly shops as well as the assembly shop. There are a number of technological and resource constraints including assembly space restriction which is most important and critical resource in the shop. It is very hard and time consuming to consider the two problems, the workload balancing and the spatial allocation problem, simultaneously, and hence, we analyze the two problems independently. The first problem has already been introduced(고시근, 1996), and the overall appearance of the system and the spatial allocation algorithm are presented in this paper.

  • PDF

A Branch and Bound Algorithm for Two-Stage Hybrid Flow Shop Scheduling : Minimizing the Number of Tardy Jobs (2단계 혼합흐름공정에서 납기 지연 작업수의 최소화를 위한 분지한계 알고리듬)

  • Choi, Hyun-Seon;Lee, Dong-Ho
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.2
    • /
    • pp.213-220
    • /
    • 2007
  • This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in stages, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

Low Complexity Multiuser Scheduling in Time-Varying MIMO Broadcast Channels

  • Lee, Seung-Hwan;Lee, Jun-Ho
    • Journal of electromagnetic engineering and science
    • /
    • v.11 no.2
    • /
    • pp.71-75
    • /
    • 2011
  • The sum-rate maximization rule can find an optimal user set that maximizes the sum capacity in multiple input multiple output (MIMO) broadcast channels (BCs), but the search space for finding the optimal user set becomes prohibitively large as the number of users increases. The proposed algorithm selects a user set of the largest effective channel norms based on statistical channel state information (CSI) for reducing the computational complexity, and uses Tomlinson-Harashima precoding (THP) for minimizing the interference between selected users in time-varying MIMO BCs.