• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.1
• /
• pp.1-9
• /
• 2015

In shipbuling processes, a quay wall is a major resource for additional operations after an erection operation at dock. A quay wall is becoming a new bottleneck instead of docks, while ship types with long operation time at quay wall are increasing recently. We developed a quay wall scheduling algorithm for the quayside operations of ships in this paper. The objective function is to minimize the sum of not assigned days of ships which have to be assigned to any quay wall under limited numbers of quay walls. The scheduling algorithm is based on an assignment method to assign each ship to a quay wall among its alternative quay walls at the time of launching or moving to another quay wall. The scheduling algorithm is also using Tabu Search algorithm to optimize assignment sequence of ships. The experiment shows that the algorithms in this paper are effective to make schedule of the quayside operations of ships.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.1
• /
• pp.26-34
• /
• 2012

Assembly scheduling in shipbuilding is responsible for determine assembly process orders and departmental production schedule for the block, the basic composite unit of ships. It is necessary much more information to decide production scheduling as the characteristic of shipbuilding which has been more complex and more various and also, a lot of waste of time and of human power is generated in the course of data processing. The target shipbuilding manufacturer of this study use empirical techniques, based on the user's discretion, to compile and to apply data which are scattered in DB storages separately. Because of that reason, the user should not only be performed identification and screening operations but also modification and verification for vast amounts of data, so it is hard to keep the consistency of the data and also the operation time is not constant. Accordingly, the object in this study is by presenting an efficient DB framework to reduce wasting time and man-hour at experienced-oriented process, abate user's manual operations and support an efficient scheduling in assembly processes.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.454-457
• /
• 2001

All of the partner must manage continually scheduling for the successful project in construction. Besides, that is not a important only contracter's managing but also owner's managing which is a very important about project finishing in time. Especially, in the case of mega project, the owner has to manage progress of scheduling to control contractor. And the case of progress to delay or to change, owner, contractor, and inspector must make a plan of recovery scheduling. This study proposes a construction process model from IDEF Methodology.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.9-16
• /
• 2016

Recently, many research groups have focused on GPGPUs in order to improve the performance of computing systems. GPGPUs can execute general-purpose applications as well as graphics applications by using parallel GPU hardware resources. GPGPUs can process thousands of threads based on warp scheduling and CTA scheduling. In this paper, we utilize the traditional CTA scheduler to assign a various number of CTAs to SMs. According to our simulation results, increasing the number of CTAs assigned to the SM statically does not improve the performance. To solve the problem in traditional CTA scheduling schemes, we propose a new IPC-based dynamic CTA scheduling scheme. Compared to traditional CTA scheduling schemes, the proposed dynamic CTA scheduling scheme can increase the GPU performance by up to 13.1%.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.3
• /
• pp.117-124
• /
• 2008

Ultra-high voltage transformer industry has characteristic of small quantity batch production system by other order processing unlike general mass production systems. In this industry, observance of time deadline is very important in market competitive power security and company continued existence. The transformer winding is a process that rolls a coil is coated with an electric insulation material in order to generate the required voltage using the voltage fluctuation. The winding process is very important production process in the extra-high voltage transformer manufacturing industry because winding process is core process that occupy weight about half of whole process and is process that decide current ratio of transformer. This paper proposes a statistical calculation and control method of planned leadtime on the basis of real data and informations for the A company in transformer winding process. Moreover, we develop unit process scheduling system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.808-811
• /
• 1996

A mathematical model was developed for the simulation of a Pressure Swing Adsorption process with dehydrogenation reaction. The minimum number of beds and optimum operating sequence were determined using MINLP under the given operating conditions. Based on these results, we estimated the minimum annual cost.

• Industrial Engineering and Management Systems
• /
• v.11 no.4
• /
• pp.310-330
• /
• 2012

Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.10a
• /
• pp.733-734
• /
• 2009

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.27-36
• /
• 1996

The objective of this paper is to outline an integrated cellular manufacturing system (ICMS) which integrates process planning and scheduling in the cellular manufacturing environment. It combines design systems with manufacturing systems in batch production. Furthermore, it is developed to overcome the difficulties that exist in the current manufacturing practices.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.4
• /
• pp.32-42
• /
• 2021

The printing process can have to print various colors with a limited capacity of printing facility such as ink containers that are needed cleaning to change color. In each container, cleaning time exists to assign corresponding inks, and it is considered as the setup cost required to reduce the increasing productivity. The existing manual method, which is based on the worker's experience or intuition, is difficult to respond to the diversification of color requirements, mathematical modeling and algorithms are suggested for efficient scheduling. In this study, we propose a new type of scheduling problem for the printing process. First, we suggest a mathematical model that optimizes the color assignment and scheduling. Although the suggested model guarantees global optimality, it needs a lot of computational time to solve. Thus, we decompose the original problem into sequencing orders and allocating ink problems. An approximate function is used to compute the job scheduling, and local search heuristic based on 2-opt algorithm is suggested for reducing computational time. In order to verify the effectiveness of our method, we compared the algorithms' performance. The results show that the suggested decomposition structure can find acceptable solutions within a reasonable time. Also, we present schematized results for field application.