• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.3
• /
• pp.73-82
• /
• 1999

In this paper, we address a single machine non-preemptive n-job scheduling problem to minimize the sum of earliness and tardiness with different release times and due dates. To solve the problem, we propose a genetic algorithm with new crossover and mutation operators to find the job sequencing. For the proposed genetic algorithm, the optimal pair of crossover and mutation rates is investigated. To illustrate the suitability of genetic algorithm, solutions of genetic algorithm are compared with solutions of exhaustive enumeration method in small size problems and tabu search method in large size problems. Computational results demonstrate that the proposed genetic algorithm provides the near-optimal job sequencing in the real world problem.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.253-256
• /
• 2000

In general, Automated Storage/Retrieval Systems (AS/RS ) have racks of equal sized cells to utilize the concept of unit-load. Most of the techniques for the performance estimation of a unit-load AS/RS are a static model or computer simulation. Especially, their models were developed under assumption that the Storage/Retrieval (S/R) machine performs only single command (SC) or dual command (DC). In reality, defending on the operating policy and the status of the system at a particular time, the S/B machine performs a SC or a DC, or becomes .: idle. In order to resolve these weak points, we propose a stochastic model for the performance estimation of unit-load AS/RS by using a single-server queueing model. Expected numbers of waiting storage and retrieval commands are found

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.2
• /
• pp.209-229
• /
• 1996

Scheduling problems which determine the sequence of jobs are one of the Important issues to many industries. This paper deals with a single-machine job sequencing problem which has complex constraints and an objective function. To solve the problem, an expressive constraint description language and an automatic code generator are developed for our scheduling system. The user just needs to describe the scheduling problem using the constraint description language that allows to express both quantitative and qualitative constraints as well as an objective function in real world semantics. Then, a complete scheduling program based on constraint satisfaction technique is automatically generated through the code generator. Advantage of this approach is that models of the scheduling problems are easily developed and maintained because models ore formulated by using the language which reflects real world semantics.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.1
• /
• pp.29-41
• /
• 1998

This paper addresses the problem of scheduling a set of jobs with a common due data on a single machine. The objective is to minimize the sum of the earliness and tardiness of jobs subject to $T_{max}{\le}{\Delta}\;for{\Delta}{\ge}0$. Properties for the $MAD/T_{max}$ problem are found and the problem is shown to be NP-complete in the ordinary sense. According to the range of Δ, the problem can be solved in polynomial time. Also, some special cases where an optimal schedule is found in polynomial time are discussed.

• Korean Management Science Review
• /
• v.31 no.2
• /
• pp.65-70
• /
• 2014

This paper considers a single machine scheduling problem to determine release and processing times where both the release times and processing times are linearly decreasing functions of resources. The objective is to minimize the sum of the associated resource consumption cost and scheduling cost including makespan, sum of completion times, maximum lateness, or sum of lateness. This paper proves that the scheduling problem is NP-hard in the strong sense even if the release times are constant.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.221-223
• /
• 2000

This paper describes the design of SVC fuzzy logic controller (SVC-FLC) using adaptive evolutionary algorithm and we tuned the gain of input-output variables of SYC-FLC using it. We performed the nonlinear simulation on an single-machine infinite system to prove the efficiency of the proposed method. The proposed SYC-FLC showed the better performance than PD controller in terms of the settling time and damping effect, for system operation condition used in evaluating the robustness and three phase grounding default in cases of nominal loading used in tuning SVC-FLC for a single-machine infinite system.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2003.04a
• /
• pp.416-421
• /
• 2003

To obtain the surface roughness with range from l0nm to In n need a ultra-Precision machine, cutting condition and the study of materials. And n have to also consider the chip and vibration of diamond tool during processing. In this paper, the cutting conditions for getting mirror surface of aluminum alloy have been examined experimentally by using ultra-precision turning and single crystal diamond tool. In generally, the cutting conditions have effect on the surface roughness in ultra-precision turning. The result of surface roughness was measured by the ZYGO New View 200.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.16 no.5
• /
• pp.14-23
• /
• 2007

Welding fabrication invariantly involves three district sequential steps: preparation, actual process execution and post-weld inspection. One of the major problems in automating these steps and developing autonomous welding system is the lack of proper sensing strategies. Conventionally, machine vision is used in robotic arc welding only for the correction of pre-taught welding paths in single pass. However, in this paper, multipass tracking more than single pass tracking is performed by conventional seam tracking algorithm and developed one. And tracking performances of two algorithm are compared in multipass tracking. As the result, tracking performance in multi-pass welding shows superior conventional seam tracking algorithm to developed one.

• Steel and Composite Structures
• /
• v.34 no.6
• /
• pp.877-889
• /
• 2020

This work features the outcomes of an empirical investigation into the characteristics of steel reinforced grout (SRG) composite - concrete interfaces. The parameters varied were loading rate, densities of steel fibres and types of load displacement responses or measurements (slip and machine grips). The following observations and results were derived from standard single-lap shear tests. Interfacial debonding of SRG - concrete joints is a function of both fracture of matrix along the bond interface and slippage of fibre. A change in the loading rate results in a variation in peak load (P_max) and the correlative stress (σ_max), slip and machine grips readings at measured peak load. Further analysis of load responses revealed that the behaviour of load responses is shaped by loading rate, fibre density as well as load response measurement variable. Notably, the out-of-plane displacement at peak load increased with increments in load rates and were independent of specimen fibre densities.

• Journal of the military operations research society of Korea
• /
• v.24 no.2
• /
• pp.162-169
• /
• 1998

This study presents an single machine scheduling algorithm minimize lateness of product by controlling machining speed. Generally, production scheduling uses the information of process planning. But the production scheduling algorithm has not considered the control of machining speed in its procedures. Therefore, the purpose of this study is to consider the machining speed in production scheduling algorithm for efficient production scheduling. Machining time and machining cost required to manufacture a piece of a product are expressed as a unimodal convex function with respect to machining speed, so it has minimal point at minimum time speed or the minimum cost speed. Therefore, because of considering the machining cost, the control of machining speed for the algorithm is executed between minimum speed and maximum speed. An example is demonstrated to explain the algorithm.