• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.19-43
• /
• 2005

This paper considers a variation of the customer order scheduling problem, and the variation is the case where the machine-job assignment is fixed. We examine the parallel machine environment, and the objective is to minimize the sum of the completion times of the batches. While a machine can process only one job at a time, different machines can simultaneously process different jobs in a batch. The recognition version of this problem is known to be NP-complete in the strong sense even if there exist only two parallel machines. When there are an arbitrary number of parallel machines, we establish three lower bounds and develop a dynamic programming (DP) algorithm which runs in exponential time on the number of batches. We present two simple but intuitive heuristics, SB and GR, and find some special cases where SB and GR generate an optimal schedule. We also find worst case upper bounds on the relative error. For the case of the two parallel machines, we show that GR generates an optimal schedule when processing times of all batches are equal. Finally, the heuristics and the lower bounds are empirically evaluated.

• Management Science and Financial Engineering
• /
• v.13 no.2
• /
• pp.47-77
• /
• 2007

This paper considers a scheduling problem where a customer orders multiple products(jobs) from a production facility. The objective is to minimize the sum of the order(batch) completion times. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. Although each job has a unique processing time, we consider the case where batch processing times are identical. This simplification allows us to develop heuristics with improved performance bounds. This problem was motivated by a real world problem encountered by foreign electronics manufacturers. We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.

• Asian-Australasian Journal of Animal Sciences
• /
• v.14 no.9
• /
• pp.1267-1271
• /
• 2001

The objective of this study was to examine the significance of feeding induced hypovolemia (decrease in plasma volume) in controlling the feed intake of goats fed on dry feed. In order to alleviate hypovolemia with feeding, a 2 h intravenous infusion (16-18 ml/min) of artificial saliva or mannitol solution was begun 1 h prior to feeding and continued until 1h after the start of the 2 h feeding period. In comparison with no infusion (NI), cumulative feed intake was increased by 41% with artificial saliva infusion (ASI) and by 45% with mannitol infusion (MI) by the completion of the 2 h feeding period. Both infusion treatments (ASI and MI) were significantly different (p<0.05) from the NI treatment in terms of the cumulative feed intake. The cumulative feed intake between the ASI and MI treatments was not significantly different (p>0.05). No infusion treatment (NI) had the lowest cumulative feed intake (929 g DM), whereas MI had the highest (1345 g DM), after completion of the 2 h feeding period. Generally, infusion treatments also increased the rate of eating at all time points after feeding was commenced. Following the first 30 mins of feeding, the rate of eating decreased sharply, and subsequently declined gradually in all treatments. Compared to the NI, both ASI and MI significantly (p<0.05) decreased thirst level (water intake for 30 mins after the completion of the 2 h feeding period) by approximately 13%. However, the thirst level caused by ASI and MI was not significantly different (p>0.05). Both ASI and MI decreased the plasma concentrations of osmolality and total protein, and hematocrit at 1 h after infusion. The results suggested that the thirst sensation in the brain could be produced by feeding induced hypovolemia. Moreover, the results indicate that hypovolemia is one of the factors controlling the feed intake of goats fed on dry feed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.4 no.1
• /
• pp.51-67
• /
• 1979

This paper considers the problem of determining an optimal dynamic operating policy for a two-stage tandem queueing service system in which the service facilities (or stages) can be operated at more than one service rate. At each period of the system's operation, the system manager must specify which of the available service rates is to be employed at each stage. The cost structure includes an operating cost for running each stage and a service facility profit earned when a service completion occurs at Stage 2. We assume that the system has a finite waiting capacity in front of each station and each customer requires two services which must be done in sequence, that is, customers must pass through Stage 1 and Stage 2 in that order. Processing must be in the order of arrival at each station. The objective is to minimize the total discounted expected cost in a two-stage tandem queueing service system, which we formulate as a Discrete-Time Markov Decision Process. We present analytical and numerical results that specify the form of the optimal dynamic operating policy for a two-stage tandem queueing service system.

• Journal of Mechanical Science and Technology
• /
• v.14 no.5
• /
• pp.508-517
• /
• 2000

For shift quality improvement, torque sensors are currently too expensive to be used on production vehicles. To achieve smooth acceleration shift, the reference trajectory of the clutch slip speed for accomplishing the shift process within a designated shift completion time and its relationship with the clutch actuating torque were suggested by Jeong and Lee (1999). In order to facilitate the proposed algorithm, nonlinear estimators for necessary information such as the axle shaft torque, clutch friction and turbine torque were designed using only speed sensors. Accounting for the modeling error, a control law for this indirect smooth shift was proposed based on the above mentioned suggestions. Simulation results of the proposed estimators and shift controller were presented and further considerations for practical applications are discussed.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.1
• /
• pp.76-82
• /
• 2004

A robust fuzzy controller is designed to stabilize a class of solvable nonlinear descriptor systems with time-varying delay. First, a new modeling and control method for nonlinear descriptor systems is presented with a fuzzy descriptor model. A sufficient condition for the existence of the fuzzy controller is given in terms of a series of LMIs. Then, a less conservative fuzzy controller design approach is obtained based on the fuzzy rules and weights. This method includes the interactions of the different subsystems into one matrix. The effectiveness of the presented approach and the design procedure of the fuzzy controller are illustrated by way of an example.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.6
• /
• pp.642-647
• /
• 2014

In this paper, a hybrid genetic algorithm (HGA) approach is proposed for an n-job, m-machine flow shop scheduling problem with limited capacity buffers with blocking in which the objective is to minimize the total stretch. The stretch of a job is the ratio of the amount of time the job spent before its completion to its processing time. HGA adopts the idea of seed selection and development in order to improve the exploitation and exploration power of genetic algorithms (GAs). Extensive computational experiments have been conducted to compare the performance of HGA with that of GA.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.383-391
• /
• 2005

The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

• The Journal of Korea Robotics Society
• /
• v.13 no.4
• /
• pp.220-229
• /
• 2018

In the midst of disaster, such as an earthquake or a nuclear radiation exposure area, there are huge risks to send human crews. Many robotic researchers have studied to send UGVs in order to replace human crews at dangerous environments. So far, two-dimensional camera information has been widely used for teleoperation of UGVs. Recently, three-dimensional information based teleoperations are attempted to compensate the limitations of camera information based teleoperation. In this paper, the 3D map information of indoor and outdoor environments reconstructed in real-time is utilized in the UGV teleoperation. Further, we apply the LTE communication technology to endure the stability of the teleoperation even under the deteriorate environment. The proposed teleoperation system is performed at explosive disposal missions and their feasibilities could be verified through completion of that missions using the UGV with the Explosive Ordnance Disposal (EOD) team of Busan Port Security Corporation.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.97-102
• /
• 2021

The development of CG technology throughout the 2000s brought about a significant growth in the animation market. This phenomenon led to an increase in the number of people required by related industries, which led to an increase in the number of related majors in universities. CG application technologies are becoming more common with the advent of YouTube and virtual YouTubers, but high technology is still required for students to get a job. This situation is not easy to include both technological and creative skills in the college animation curriculum. In order to increase students' creativity, we need a lot of production experience, which requires a lot of knowledge and time if we only use tools like Maya and 3D Max. In this paper, We tried to devote more time to storytelling by minimizing the technical process required for production and proceeding with repetitive or difficult processes for content creation using third-party programs. And through the 12-week class, the experimental production process was applied to the process from planning to completion of animation works that students would submit to the advertisement contest.