• 한국항해학회지
• /
• 제18권2호
• /
• pp.57-67
• /
• 1994

This paper treats the optimization analysis of tactical ship scheduling problems in the world seaborne bulk trade. The authors use the term 'tactial' to describe the ship scheduling problem where the owners should employ skillful tactics as an expedient toward gaining the higher profits per period in short term. Relevent research and related problems on ship scheduling problems are reviewed briefly and a model for the tactical ship scheduling problem formulated as Set Problem is introduced by modifying the previous work of Fisher(1989). The reality and practicability of the model is validated by some ship-ping statistics. Proper solution approaches are outlined in the context of computational tractability in tackling the Mixed Integer Propramming. Some underlying consideration for the computational experiment is also mentioned. The authors conclude the paper with the remarks on the need of user-friendly Decision Support System for ship scheduling under varying decision environment.

• Journal of information and communication convergence engineering
• /
• 제11권4호
• /
• pp.235-240
• /
• 2013

Cloud systems are popular computing environment because they can provide easy access to computing resources for users as well as efficient use of resources for companies. The resources of cloud computing are heterogeneous and jobs have various characteristics. One such issue is effective job scheduling. Scheduling in the cloud system may be defined as a multiple criteria decision model. To address this issue, this paper proposes a priority-based two-step job scheduling algorithm. On the first level, jobs are classified based on preference. Resources are dedicated to a job if a deadline failure would cause severe results or critical business losses. In case of only minor discomfort or slight functional impairment, the job is scheduled using a best effort approach. On the second level, jobs are allocated to adequate resources through their priorities that are calculated by the analytic hierarchic process model. We then analyze the proposed algorithm and make a scheduling example to confirm its efficiency.

• 산업경영시스템학회지
• /
• 제25권3호
• /
• pp.41-49
• /
• 2002

In the study, for the practical approaches of job shop scheduling, we propose the new dispatching rules of job shop scheduling in order to complement the practical applications in the existing researches. The assumed situation for the practical approaches considers the following; relaxation of assumption for capacity constraint by machine flexibility, the addition of the common use of jig and fixture, unbalanced machine workloads and duedate tightness, and produces fast rescheduling that reflects unexpected situations. The performance of the new dispatching rules is compared and analyzed with the existing methods through the computer experiments in the assumed conditions. The results can be useful to improving a field application of the job shop scheduling.

• 산업경영시스템학회지
• /
• 제19권39호
• /
• pp.275-284
• /
• 1996

It can be made a definition that scheduling is a imposition of machinery and equipment to perform a collection of tasks. Ultimately scheduling is an assessment of taking order for which would be perform. So it is called "sequencing" in other words. In a job shop scheduling, the main object is to making delivery in accordance with the due date and order form customer, not to producing lots of quantity with minimizing mean flow time in a given time. Actually, in a company, they concentrate more in the delivery than minimizing the mean flow time. Therefore this paper suggest a new priority dispatching rule under consideration as below in a n/m job shop scheduling problem with due date. 1. handling/transportation time, 2. the size of customer order With this algorithm, we can make a scheduling for minimizing the tardiness of delivery which satisfy a goal of production.roduction.

• 한국통신학회논문지
• /
• 제23권5호
• /
• pp.1241-1248
• /
• 1998

전송 속도가 재생 속도보다 빠른 통신망 환경에서 저장-재생 방식을 이용하여 멀티캐스팅 기회를 동적으로 생성해 멀티미디어 리트리벌 서비스의 효율을 높일 수 있다. 본 논문에서는 멀티캐스트 전송에서의 상이한 수신자 환경을 고려한 멀티캐스트 그룹 스케줄링 방법인 MTS(Maximum Throughput Scheduling) 알고리즘을 제안하였다. 이 방법은 수신자까지의 대역폭을 최대로 이용하는 단대단 전송을 반복하는 방식과 멀티캐스트 전송을 이용하여 서버의 효율을 높이는 방법을 절충한 것으로 서버의 처리율을 높일 수 있도록 가입자들의 수신율에 따라 멀티캐스트 그룹을 부그룹으로 나누어 실제 처리율이 가장 높은 세그먼트를 선택한다. MTS의 성능을 분석하기 위해 시뮬레이션을 통해 대역폭의 상이함을 고려하지 않은 알고리즘인 EDS(Earliest Deadline Scheduling), MMS(Most Multicasting Scheduling)와 비교하였다. MTS 알고리즘은 가입자들의 수신율이 상이할 때 다른 스케줄링 알고리즘에 비해 우수한 성능을 나타내는 것을 발견하였다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권7호
• /
• pp.501-508
• /
• 2004

In this paper, a coordinated scheduling algorithm is proposed to reduce end-to-end delay in distributed control of systems. For the algorithm, the analysis of practical end-to-end delay in the worst case is performed priory with considering implementation of the systems. The end-to-end delay is composed of the delay caused by multi-task scheduling of operating systems, the delay caused by network communications, and the delay caused by asynchronous timing between operating systems and network communications. Through some simulation tests based on CAN(Controller Area Network), the proposed worst case end-to-end delay analysis is validated. Through the simulation tests, it is also shown that a real-time distributed control system designed to existing worst case delay cannot guarantee end-to-end time constraints. With the analysis, a coordinated scheduling algorithm is proposed here. The coordinated scheduling algorithm is focused on the reduction of the delay caused by asynchronous timing between operating systems and network communications. Online deadline assignment strategy is proposed for the scheduling. The performance enhancement of the distributed control systems by the scheduling algorithm is shown through simulation tests.

• ETRI Journal
• /
• 제33권5호
• /
• pp.689-694
• /
• 2011

In this paper, we study scheduling schemes for two-user two-way wireless relaying systems. Two transmission modes are considered: point-to-point direct transmission and two-way amplify-and-forward relaying. An optimal scheduling scheme that opportunistically selects the best transmission mode for each user is proposed to minimize the sum bit error rate (BER). The performance lower bound of the optimal scheduling scheme is analyzed, and closed-form expression of the lower-bound BER is derived. However, for optimal scheduling, the scheduler requires the knowledge of channel state information (CSI) of all links. To reduce the feedback information of CSI, we also propose a suboptimal scheduling scheme that selects the transmission mode using only the CSI of two direct links. Simulation results show that there are 4 dB to 8 dB gains for the proposed optimal and suboptimal schemes over the fixed direct transmission and fixed two-way relayed transmission scheme. The performance gap between the optimal and suboptimal scheduling schemes is small, which implies a good trade-off between implementation complexity and system performance.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2009년도 추계학술대회 논문집
• /
• pp.733-734
• /
• 2009

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.519-522
• /
• 1998

The Constructive Battle simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under rea-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. The constructive simulation system is one of the famous real-time system software, nd the one common feature of all real-time systems is defined as the correctness of the system depend not only on the logical result of computation, but also on the time at which the results are produced. Conventionally, scheduling and resource allocation activities which have timing constraints are major problem of real-time computing systems. To overcome these constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rae monotonic scheduling.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.111.1-111
• /
• 2001

In this paper, a robust speed control is proposed for Permanent Magnet Synchronous Motor system. PMSM without reduction gear has been widely used in high performance application such as robots and machine tools. It is well known that the control performance of the PMSM is very sensitive to load disturbance and system parameter variation. The idea of the proposed speed controller based on combination of sliding mode control with fuzzy gain scheduling. The sliding mode controller leads to fast system dynamics of slight sensitivity to the load disturbance and system parameter variations, the fuzzy gain scheduling mechanism reduces the chattering phenomenon. The simulation results have proved that the proposed control scheme provides a robust control performance under load disturbance and system parameter variation.