• 대한산업공학회지
• /
• 제40권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.

• 한국경영과학회지
• /
• 제33권3호
• /
• pp.1-16
• /
• 2008

This paper considers a scheduling problem to minimize the total tardiness in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple tasks, each task is performed on the fabrication machine specified in advance. After all the tasks of a job are finished, the assembly task can be started on the final-assembly machine. The completion time of a job is the time that the assembly task for the job is completed. The objective of this paper is to find the optimal schedule minimizing the total tardiness of a group of jobs. In the problem analysis, we first derive three solution properties to determine the sequence between two consecutive jobs. Moreover, two lower objective bounds are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed properties, branch-and-bound and heuristic algorithms are evaluated through numerical experiments.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2001년도 춘계학술대회
• /
• pp.195-198
• /
• 2001

This paper addresses the problem of placing tools in a tool magazine with random-select capability on a flexible machine. The tool placement problem could be a significant portion of the total processing time. It is assumed that the total number of tools required to process a set of parts exceeds the available magazine capacity, and so tool switches may occur between two adjacent parts in a given part sequence. Two heuristics are presented so as to minimize the total travel distance of the tool magazine before the completion of all parts.

• Management Science and Financial Engineering
• /
• 제5권1호
• /
• pp.1-25
• /
• 1999

There is a worldwide trend to automate the handling operations in port container terminals in an effort to improve productivity and reduce labor cost. This study iscusses how to apply an AGV(automated guided vehicle) system to the handling of containers in the yard of a port container ter-minal. The main issue of this paper is how to assign tasks of container delivery to AGVs during ship operations in an automated port container terminal. A dual-cycle operation is assumed in which the loading and the discharging operation can be performed alternately. Mixed integer linear program-ming formulations are suggested for the dispatching problem. The completion time of all the dis-charging and loading operations by a quayside crane is minimized, and the minimization of the total travel time of AGVs is also considered as a secondary objective. A heuristic method using useful properties of the dispatching problem is suggested to reduce the computational time. The perfor-mance of the heuristic algorithm is evaluated in light of solution quality and computation time.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 1998년도 공동추계학술대회 경제위기 극복을 위한 정보기술의 효율적 활용
• /
• pp.731-740
• /
• 1998

This paper discusses a brcriterion approachto sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach , which produces an efficient frontier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the resource allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.

• Tuberculosis and Respiratory Diseases
• /
• 제59권1호
• /
• pp.69-76
• /
• 2005

연구배경 : 결핵성 흉막염은 치료 이후 약 43 - 50%에서 잔여 흉막비후가 남으며 최근 치료 종결 이후에도 잔여 흉막비후의 자연흡수가 있을 수 있다. 저자들은 결핵성 흉막염에서 치료 종결 시점과 이후 마지막 추적 관찰시점까지 흉막 비후 정도를 추적 관찰하여 자연 흡수정도를 알아보고 이에 따라 흉막비후의 예측인자를 알아보고자 하였다. 방 법 : 2001년 3월부터 2003년 6월까지결핵성흉막염으로 진단받고 외래 추적 관찰이 이루어진 환자 64명을 대상으로 후향적으로 분석하였다. 결 과 : 투약 종료 시에 2mm이상의 잔여 흉막비후를 보이는 경우는 56%, 마지막 관찰시점(관찰기간중앙값 8개월)에서 42%로 9례가 관찰기간 중 자연 흡수되어 흉막비후가 소실됐으며, 15 례에서 10mm 미만으로 감소하는 소견을 보였다. 투약 종료 시에 흉막비후가 남아있던 36례 중 92%가 마지막 추적시까지 흉막비후가 완전히 또는 부분적으로 자연흡수되는 소견을 보였으며, 흉막비후의 감소는 유의한 차이를 보였다(p=0.00). 투약 종료 시에 잔여 흉막비후의 예측인자는 높은 CRP였고 최종 관찰시점에서는 흉수 내 낮은 총 백혈구치이었다. 결 론 : 결핵성 흉막염은 치료종결 후에도 자연흡수가 이루어지며 이는 흉막비후의 유무를 진단하는데 있어 치료종결시점이 아닌 추적 관찰이 이루어진 후에 판단하고, 그에 따른 예측인자를 분석하는 시도가 필요하리라 생각된다.

• Asian-Australasian Journal of Animal Sciences
• /
• 제14권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.

• 산업경영시스템학회지
• /
• 제20권44호
• /
• pp.1-12
• /
• 1997

In this paper a new heuristic algorithm has been developed and presented for minimizing the total completion time of a scheduling problem in a multi stage automated machining and assembly systems. The proposed Higher Ratio First(HRF) algorithm is based on the idea that jobs with higher processing time ratio should be a higher priority. The heuristic algorithm is implemented on the various problem cases by number of jobs and machines. The proposed algorithm provided smaller makespan than the makespan applied by three previously documented heuristics. The results obtained show a superior solution by the new heuristic over previous heuristics on all problem sizes.

• 대한산업공학회지
• /
• 제26권3호
• /
• pp.238-248
• /
• 2000

Facilities are getting more automated and informative in modern manufacturing systems, especially in semiconductor and LCD plants. These systems keep a great deal of such information on its current and near-future status as the arrival time and job completion time of their parts. This paper presents an efficient policy for AGV and part routing using information on the future status of the system where AGVs are playing a central role for material handling. Efficient control of AGVs is very important because AGV systems often become the bottleneck and limit the total production capacity of a very expensive plant. The cell controller records the future events chronologically in Next Event Schedule, and uses this list to determine to which place the AGVs and parts to be sent.

• 대한안전경영과학회지
• /
• 제25권2호
• /
• pp.1-8
• /
• 2023

This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as "makespan". This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator's experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.