• 제어로봇시스템학회논문지
• /
• 제9권9호
• /
• pp.727-735
• /
• 2003

The determination of completion time constitutes an important step in developing algorithms for short-term production scheduling. Existing completion time algorithms of multi-product batch processes often assume that intermediate storage tanks are always available when it is needed. In this paper, we consider a serial multi-product batch plants with ZW and NIS policy intermediate storge tank. We limit storage residence time and allocated products in the intermediate storage tank to minimize the quality change of the stored material as well as to reduce the clearing time during product change. A set of recurrence relations is suggested to calculate the completion times for the given batch sequence of products on all processing units. Also analytic solution for the suggested model is solved by a graphical method. The effectiveness of these results is proved by a few illustrative examples.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.291-297
• /
• 2003

This paper considers discrete-time two-class Ge $o^{X/}$G/1 queues with preemptive repeat priority. Service times of messages of each priority class are i.i.d. according to a general discrete distribution function that may differ between two classes. Completion times are derived for the preemptive repeat identical and different priority disciplines. By using the completion time, the stability condition for our system is investigated.d.

• 산업공학
• /
• 제24권4호
• /
• pp.281-294
• /
• 2011

This paper considers the rail crane scheduling problem which is defined as determining the sequence of loading/unloading container on/from a freight train. The objective is to minimize the weighted sum of the range of order completion time and makespan. The range of order completion time implies the difference between the maximum of completion time and minimum of start time of each customer order consisting of jobs. Makespan refers to the time when all the jobs are completed. In a rail freight terminal, logistics firms as a customer wish to reduce the range of their order completion time. To develop a methodology for the crane scheduling, we formulate the problem as a mixed integer program and develop three metaheuristics, namely, genetic algorithm, simulated annealing, and tabu search. To validate the effectiveness of heuristic algorithms, computational experiments are done based on a set of real life data. Results of the experiments show that heuristic algorithms give good solutions for small-size and large-size problems in terms of solution quality and computation time.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2011년도 춘계학술대회 논문집
• /
• pp.269-276
• /
• 2011

This paper considers the rail crane scheduling problem with minimizing the sum of the range of order completion time and make-span of rail crane simultaneously. The range of order completion time implies the difference between the maximum of completion time and minimum of start time. Make-span refers to the time when all the tasks are completed. At a rail terminal, logistics companies wish to concentrate on their task of loading and unloading container on/from rail freight train at a time in order to increase the efficiency of their equipment such as reach stacker. In other words, they want to reduce the range of their order completion time. As a part of efforts to meet the needs, the crane schedule is rearranged based on worker's experience. We formulate the problem as a mixed integer program. To validate the effectiveness of the model, computational experiments were conducted using a set of data randomly generated.

• 경영과정보연구
• /
• 제5권
• /
• pp.287-300
• /
• 2000

Project Managers want to reduce the cost and the completion time of the project simultaneously. But the project completion time tends to increase as the project cost is reduced, and the project cost has a tendency to increase as the project completion time is reduced. In this paper, the resource constrained project scheduling problem with multiple crashable modes is considered. An exact solution method for finding the efficient solution set and the computational results are introduced.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.307-309
• /
• 1996

This paper analyses a deterministic scheduling problem concerned with manufacturing two types of components at a pre-assembly stage which consists of two independent feeding machines each producing its own type of component. Each type represents a unique component which may have variations in its size or quality. Therefore, the completion time of each component depends on both its type and quality (size) variations. Such manufactured components are subsequently assembled into various component dependent products. The problem has the objective measure of minimizing the total weighted completion time of a finite number of jobs(products) where the completion time of each job is measured by the latest completion time of its two components at the pre-assembly stage. The problem is shown to be NP-complete in the strong sense. A WSPT rule coupled with a machine-aggregation idea is developed for good heuristics which show the error bound of 2.

• 한국전문물리치료학회지
• /
• 제8권2호
• /
• pp.87-94
• /
• 2001

Dexterity is defined in the present study as interdigital manipulative skill or the fine manipulative movements of objects held between the thumb and fingers. The Grooved pegboard test has been used to evaluate dexterity requring visual-motor coordination. The purpose of this study was to standardize the completion time of the Grooved pegboard test in different age groups and gender. Normative values for the Grooved Pegboard Test was developed on the sample of 282 healthy volunteers (89 men and 183 women). Subjects were stratified according to gender and dominant hand and were subdivided into six groups by blocking. The results of this study were as follows: 1) There was a significant difference in completion time between dominant and nondominant hand in both men and women groups (p<.05). 2) There were significant differences in completion time between men and women group (p<.05) 3) There were significant differences in completion time among age groups (p<.05).

• 한국수학교육학회지시리즈A:수학교육
• /
• 제51권4호
• /
• pp.317-335
• /
• 2012

The purposes of this study were to investigate the perceptions of teachers and students on the implementation of the intensive course completion system in mathematics courses and to provide suggestions for the improvement of the system. Five high school mathematics teachers and 338 10th graders and 87 11th graders in 2 high schools located in Gyeonggi-do participated in this study. The results of this study indicated that the intensive course completion system is more appropriate to the subjects which require less time allotment or practical exercise than mathematics courses. For better implementation of the intensive course completion system in mathematics courses, first of all, enough time allotment for teaching and learning mathematics should be guaranteed. Otherwise, the system can make students feel more burden of learning due to increase in learning volume of mathematics courses.

• 한국컴퓨터정보학회논문지
• /
• 제22권10호
• /
• pp.101-107
• /
• 2017

In this paper, we study the problem of parallel machine scheduling considering the moving time of multiple servers. The parallel machine scheduling is to assign jobs to parallel machines so that the total completion time(makespan) is minimized. Each job has a setup phase, a processing phase and a removal phase. A processing phase is performed by a parallel machine alone while a setup phase and a removal phase are performed by both a server and a parallel machine simultaneously. A server is needed to move to a parallel machine for a setup phase and a removal phase. But previous researches have been done under the assumption that the server moving time is zero. In this study we have proposed an efficient algorithm for the problem of parallel machine scheduling considering multiple server moving time. We also have investigated experimentally how the number of servers and the server moving time affect the total completion time.

• 한국전자거래학회지
• /
• 제17권2호
• /
• pp.149-163
• /
• 2012

물류 시스템은 다양한 프로세스에 걸친 한정된 자원들의 작업을 통해 고객에게 서비스를 제공한다. 이와 같은 복잡한 환경에서 높은 서비스 수준을 유지하기 위해서는 프로세스 진행 상황에 대한 실시간 모니터링과 그를 통한 성과 달성도의 지속적인 관리가 필수적으로 요구된다. 본 연구에서는 컨테이너 터미널을 대상으로 선박 물류 프로세스의 서비스 완료시간을 예측하는 방법론을 제시한다. 이를 위해 먼저 선박에서 컨테이너를 싣고 내리는 프로세스에 영향을 미치는 요인을 파악한다. 그리고, 확인된 요인들 중 영향 정도를 직접적으로 측정하기 어려운 것에 대해 정량적인 값을 추정하는 방안을 개발한다. 서비스 완료 시간에 대한 실시간 예측은 의사결정 나무를 사용한다. 과거 프로세스 진행 이력을 바탕으로 의사결정 나무를 학습시킨 후, 특정 시점에서 실시간 요인의 상태를 이용하여 서비스 완료시간을 예측한다. 컨테이너 터미널 시뮬레이션 모형을 활용하여 본 연구에서 제시하는 방법론을 검증하였다.