• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.3
• /
• pp.305-312
• /
• 2014

This research deals with a problem that minimizes makespan in a non-identical parallel machine system with sequence and machine dependent setup times and machine dependent processing times. We first present a new mixed integer programming formulation for the problem, and using this formulation, one can easily find optimal solutions for small problems. However, since the problem is NP-hard and the size of a real problem is large, we propose four heuristic algorithms including genetic algorithm based heuristics to solve the practical big-size problems in a reasonable computational time. To assess the performance of the algorithms, we conduct a computational experiment, from which we found the heuristic algorithms show different performances as the problem characteristics are changed and the simple heuristics show better performances than genetic algorithm based heuristics for the case when the numbers of jobs and/or machines are large.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.77-87
• /
• 1995

In this paper we develop an efficient heuristic algorithm for the problem of scheduling n sequence-dependent jobs on a basic processor to minimize makespan. Efficient solution methods are already known for the sequence- independent case. But for the sequence-dependent case, this problem belongs to a set of strong NP-complete problems. We present a heuristic which is similar to shortest setup time heuristic but opportunity cost of setup time rather than shortest setup time is used for choosing next job. This heuristic algorithm has same computational complexity and worst case ratio as the shortest setup time heuristic. We used Wilcoxon signed rank test to show that our heuristic is superior to nearest setup time heuristic in term of average behavior.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.431-446
• /
• 1998

In this paper, we consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, we first propose a dynamic programming(DP) algorithm for sequencing jobs processed on a single machine. The algorithm is then extended to handle jobs on parallel-identical machines. Finally, we developed an improved version of the algorithm which generates optimal solutions using much smaller amount of memory space and computing time. Computational results are provided to illustrate the performance of the DP algorithms.

• Steel and Composite Structures
• /
• v.38 no.4
• /
• pp.447-462
• /
• 2021

In this work, we consider a problem in the context of thermoelectric materials with memory-dependent derivative for a half space which is assumed to have variable thermal conductivity depending on the temperature. The Lamé's modulii of the half space material is taken as a function of the vertical distance from the surface of the medium. The surface is traction free and subjected to a time dependent thermal shock. The problem was solved by using the Laplace transform method together with the perturbation technique. The obtained results are discussed and compared with the solution when Lamé's modulii are constants. Numerical results are computed and represented graphically for the temperature, displacement and stress distributions. Affectability investigation is performed to explore the thermal impacts of a kernel function and a time-delay parameter that are characteristic of memory dependent derivative heat transfer in the behavior of tissue temperature. The correlations are made with the results obtained in the case of the absence of memory-dependent derivative parameters.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.10
• /
• pp.1854-1860
• /
• 2008

In this paper, we deal with the problem of delay-dependent robust and non-fragile stabilization for descriptor systems with parameter uncertainties and time-varying delays on the basis of strict LMI(linear matrix inequality) technique. Also, the considering controller is composed of multiplicative uncertainty. The delay-dependent robust and non-fragile stability criterion without semi-definite condition and decomposition of system matrices is obtained. Based on the criterion, the problem is solved via state feedback controller, which guarantees that the resultant closed-loop system is regular, impulse free and stable in spite of all admissible parameter uncertainties, time-varying delays, and controller fragility. Numerical examples are presented to demonstrate the effectiveness of the proposed method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.517-532
• /
• 1996

The area and time-dependent vehicle scheduling problem(ATVSP) is a generalization of the vehicle scheduling problem in which the travel speed between two locations depends on the passing areas and time of day. We propose a simple model for estimating area and time-dependent travel speeds in the ATVSP that relieves much burden for the data collection and storage problems. A mixed integer nonlinear programming formulation of the ATVSP is presented. We also propose three heuristics for the ATVSP, developed by extending and modifying existing heuristics for conventional vehicle scheduling problems. The results of computational experiments demonstrate that the proposed estimation model performs well and the saving method is the best among the three heuristics.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.1
• /
• pp.140-147
• /
• 2012

Vehicle routing problem is one of the traveling salesman problems with various conditions such as vehicle capacity limits, delivery time windows, as well as time dependent speeds in metropolitan area. In this research hourly vehicle moving speeds information in a typical metropolitan area are analyzed to use the results in the design procedure of VRP heuristic. Quality initial vehicle routing solutions can be obtained with adaption of the analysed results of the time periods with no vehicle speed changes. This strategy makes complicated time dependent vehicle speed simple to solve. Time dependent vehicle speeds are too important to ignore to obtain optimum vehicle routing search for real life logistics systems.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.1
• /
• pp.193-198
• /
• 2009

In this paper, we consider the design problem of delay-dependent robust $H{\infty}$ controller of discrete-time descriptor systems with parameter uncertainties and interval time-varying delays in state and control input by delay-dependent LMI (linear matrix inequality) technique. A new delay-dependent bounded real lemma for discrete-time descriptor systems with time-varying delays is derived. The condition for the existence of robust $H{\infty}$ controller and the robust $H{\infty}$ state feedback control law are proposed by LMI approach. A numerical example is demonstrated to show the validity of the design method.

• IE interfaces
• /
• v.25 no.3
• /
• pp.357-364
• /
• 2012

This paper considers a unrelated parallel machine scheduling problem with ready times, due times and sequence and machine-dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of machines to minimize the total tardy time. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain optimal solutions as the problem size becomes large. Therefore, a genetic algorithm using an effective dispatching method is proposed. The performance of the proposed genetic algorithm is evaluated using several randomly generated examples.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2000.06a
• /
• pp.3-10
• /
• 2000

The undesired situation of development of tribology and its reason is analyzed. The problem comes from insufficient study on the concept system and method system, which can match the name, definition and nature of tribology. The existence of three axioms in tribology is discussed. They are axiom of system dependent, axiom of time dependent and axiom of coupling of behaviors of multi-discipline. A series of lemmas has been deduced from three axioms. It is expected that they can be a foundation to establish the concept system and method system.