• Journal of the Korean Institute of Navigation
• /
• v.14 no.1
• /
• pp.21-38
• /
• 1990

This paper discusses the various modes of operations of cargo ships which are liner operations, tramp shipping and industrial operations, and mathematical programming, simulation , and heuristic method that can be used to solve ships routing and scheduling problems for each of these operations. In particular, this paper put emphasis on a crude oil tanker scheduling problem. The problem is to achieve an optimal sequence of cargoes or an optimal schedule for each ship in a given fleet during a given period. Each cargo is characterized by its type, size, loading and discharging ports, loading and discharging dates, cost, and revenue. Our approach is to enumerate all feasible candidate schedate schedules for each ship, where a candidate schedule specifies a set of cargoes that can be feasibly carried by a ship within the planning horizon , together with loading and discharging dates for each cargo in the set. Provided that candidate schedules have been generated for each ship, the problem of choosing from these an optimal schedule for each ship is formulated as a set partitioning problem, a set packing problem, and a integer generalized network problem respectively. We write the PASCAL programs for schedule generator and apply our approach to the crude oil tanker scheduling problem similar to a realistic system.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.1
• /
• pp.39-44
• /
• 2005

Scheduling for digital system synthesis is assigning each operation in a control/data flow graph(CDFG) to a specific control step without violating precedence relation. It is one of the most important tasks due to its direct influence on the performance of the hardware synthesized. In this paper, we propose a resource-constrained scheduling algorithm. Our algorithm first analyzes the given CDFG to determine the number of functional units of each type, then assigns each operation to a control step while satisfying the constraints. It also tries to improve the solution iteratively by adjusting the number of functional units using the results collected from the previous scheduling. Experiments were performed to test the performance of the proposed algorithm, and results are presented

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.511-518
• /
• 2002

Symmetric Multiprocessors (SMP) has emerged as an important and cost-effective platform for high performance parallel computing. Scheduling of parallel tasks and communications of SMP is important because the choice of a scheduling discipline can have a significant impact on the performance of the system. In this paper, we present a task duplication based scheduling scheme for bus-based SMP. The proposed scheme pre-allocates network communication resources so as to avoid potential communication conflicts. The performance of the proposed scheme has been observed by comparing the schedule length under various number of processors and the communication cost.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.19-26
• /
• 2021

CPU is considered the main and most important resource in the computer system. The CPU scheduling is defined as a procedure that determines which process will enter the CPU to be executed, and another process will be waiting for its turn to be performed. CPU management scheduling algorithms are the major service in the operating systems that fulfill the maximum utilization of the CPU. This article aims to review the studies on the CPU scheduling algorithms towards comparing which is the best algorithm. After we conducted a review of the Round Robin, Shortest Job First, First Come First Served, and Priority algorithms, we found that several researchers have suggested various ways to improve CPU optimization criteria through different algorithms to improve the waiting time, response time, and turnaround time but there is no algorithm is better in all criteria.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.68 no.3
• /
• pp.405-415
• /
• 2019

The considerations of the electrical device' characteristics and the customers' satisfaction have been important criteria for efficient smart grid systems. In general, an electrical device is classified into a non-interruptible device or an interruptible device. The consideration of the type is an essential information for the efficient smart grid scheduling. In addition, customers' scheduling preferences or satisfactions have to be considered simultaneously. However, the existing research studies failed to consider both criteria. This paper proposes a new and efficient smart grid scheduling framework considering both criteria. The framework consists of two modules - 1) A day-head smart grid scheduling algorithm and 2) Real-time sudden demand negotiation framework. The first method generates the smart grid schedule efficiently using an embedded genetic algorithm with the consideration of the device's characteristics. Then, in case of sudden electrical demands, the second method generates the more efficient real-time smart grid schedules considering both criteria. In order to show the effectiveness of the proposed framework, comparisons with the existing relevant research studies are provided under various electricity demand scenarios.

• International Journal of Computer Science & Network Security
• /
• v.24 no.1
• /
• pp.215-225
• /
• 2024

Predictive maintenance has been considered fundamental in the industrial applications in the last few years. It contributes to improve reliability, availability, and maintainability of the systems and to avoid breakdowns. These breakdowns could potentially lead to system shutdowns and to decrease the production efficiency of the manufacturing plants. The present article aims to study how predictive maintenance could be planed into the production scheduling, through a systematic review of literature. . The review includes the research articles published in international journals indexed in the Scopus database. 165 research articles were included in the search using #predictive maintenance# AND #production scheduling#. Press articles, conference and non-English papers are not considered in this study. After careful evaluation of each study for its purpose and scope, 50 research articles are selected for this review by following the 2020 Preferred Reporting Items for Systematic Review and Meta-Analysis Protocols (PRISMA) statement. A benchmarking of predictive maintenance methods was used to understand the parameters that contributed to improve the production scheduling. The results of the comparative analysis highlight that artificial intelligence is a promising tool to anticipate breakdowns. An additional impression of this study is that each equipment has its own parameters that have to be collected, monitored and analyzed.

• Journal of Korean Society for Quality Management
• /
• v.28 no.1
• /
• pp.196-209
• /
• 2000

In order to intensify an enterprise competition, quality inspection controls are very important issue. An organization or division of a company hopes which to acquire the quality inspection information be updated in real-time with respect to shop floor. In this paper, we develop a quality inspection control system for a Turbine/Generator production industry. The system compromises inspection scheduling module related to shop floor control (SFC) system, formal documentation control module, and formal inspection control module. In the quality inspection control system, ORACLE RDBMS is used for the database management system and ORACLE DEVELOPER 2000 is used for system development tool. The characteristic of this system is to support so it can enhance productivity and quality through inspection plans related to production scheduling.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.2 no.2
• /
• pp.83-91
• /
• 1999

Dynamic characteristic of manufacturing stage is understood and the utilization of each machine is maximized by developing on-line dynamic CAPP system to consider the overloads in the aircraft part manufacturing line. In this paper, a scheme of production planning and scheduling system was proposed through inspection about some predeveloped CAPP system. Developed production planning and scheduling system included process planning module. After precise inspection of some FMS line schema at domestic heavy industry, optimized FMS line was applied to aircraft part manufacturing and repairing factory. By virtue of considering overloads of factory and machine through on-line dynamic CAPP system, the utilization of resources is maximized and manufacturing lead time is minimized.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.52-57
• /
• 2016

We introduce a hybrid scheduling in a multi-path poor scattering full-duplex (FD) system, which consists of one multi-antenna FD base station and a large number of single-antenna half-duplex mobile stations. Our hybrid scheduling utilizes partial channel state information at the transmitter. In particular, unlike the conventional scheduling method using opportunistic transmission for both uplink and downlink, the proposed scheme combines a random transmit beamforming for downlink and a zero forcing beamforming for uplink. As our main result, via computer simulations, it is shown that the proposed scheme has a superior sum-rate performance than that of the conventional scheduling method beyond a certain signal-to-noise ratio regime.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.83-102
• /
• 2005

The problem of video scheduling is analyzed in the framework of divisible load scheduling. A divisible load can be divided into any number of fractions (parts) and can be processed/computed independently on the processors in a distributed computing system/network, as there are no precedence relationships. In the video scheduling, a frame can be split into any number of fractions (tiles) and can be processed independently on the processors in the network, and then the results are collected to recompose the single processed frame. The divisible load arrives at one of the processors in the network (root processor) and the results of the computation are collected and stored in the same processor. In this problem communication delay plays an important role. Communication delay is the time to send/distribute the load fractions to other processors in the network. and the time to collect the results of computation from other processors by the root processors. The objective in this scheduling problem is that of obtaining the load fractions assigned to each processor in the network such that the processing time of the entire load is a minimum. We derive closed-form expression for the processing time by taking Into consideration the communication delay in the load distribution process and the communication delay In the result collection process. Using this closed-form expression, we also obtain the optimal number of processors that are required to solve this scheduling problem. This scheduling problem is formulated as a linear pro-gramming problem and its solution using neural network is also presented. Numerical examples are presented for ease of understanding.