• 경영과학
• /
• 제24권2호
• /
• pp.33-42
• /
• 2007

In this paper we consider an alternate m machine scheduling problem in which each job having at most two eligible machines should be assigned with the objective of makespan minimization. For this problem. we propose a $O(m2^m)$ time rounding algorithm with performance ratio at most 1.5. For a little general problem where each job can be processed in at most three machines, we prove that a polynomial time algorithm does not exist with performance ratio less than 1.5.

• 산업경영시스템학회지
• /
• 제21권45호
• /
• pp.25-32
• /
• 1998

A modified simulated annealing algorithm is proposed and applied to the permutation flowshop scheduling with the makespan objective. Based on the job deletion and insertion method, a newly defined Max-min perturbation scheme is proposed to obtain a better candidate solution in the simulated annealing process. The simulation experiments are conducted to evaluate the effectiveness of the proposed algorithm against the existing heuristics and results are reported.

• 대한안전경영과학회지
• /
• 제5권3호
• /
• pp.165-177
• /
• 2003

크로스도킹이란 창고나 물류센터에 하역된 물품이 저장됨이 없이 도착지별로 재분류되어서 직출하되는 물류 시스템이다. 크로스도킹은 물류비용의 큰 비중을 차지하는 보관비용을 감소시킬 수 있을 뿐만 아니라 고객의 요구에 빠른 대응을 할 수 있다는 장점을 지니고 있다. 크로스도킹이 성공적으로 수행되기 위해서는 창고나 물류센터의 입고에서부터 출고까지의 모든 작업들이 계획적이고 원활하게 수행되어져야만 한다. 본 연구에서는 임시보관 장소를 보유하지 않은 크로스도킹 시스템의 총 운영시간을 최소화하기 위한 입고 트럭과 출고 트럭의 일정계획 수립을 위한 수학적 모델을 개발하였다.

• 대한산업공학회지
• /
• 제29권3호
• /
• pp.190-196
• /
• 2003

We consider the problem of scheduling n jobs on m machines with the objective of minimizing makespan. Each job cannot be eligible to all the machines but to its consecutively eligible set of machines. For this problem, a 2-approximation algorithm, MFFH, is developed. In addition, an example is presented to show the tightness of the algorithm.

• 대한산업공학회지
• /
• 제22권4호
• /
• pp.607-617
• /
• 1996

This paper shows that fuzzy set theory can be useful in modeling and solving job scheduling problems with uncertain processing times. The processing times are considered as fuzzy numbers(fuzzy intervals or time intervals) and the fuzzy Delphi method is used to estimate a reliable time interval of each processing time. Based on these time estimates, we then propose an efficient methodology for calculating the optimal sequence and the fuzzy makespan.

• 산업융합연구
• /
• 제5권2호
• /
• pp.21-32
• /
• 2007

This paper deals with the sequencing problem in the operation of the manufacturing systems with the constraint of buffer capacity. Some of studies for this theme have been progressed for several years. And then most of them considered only one objective, such as maximum lateness, machine utilization, makespan, mean flowtime and so on. This study deal with two objectives of the delivery for customers and the idle time of machines for producers. For the decision of sequence, the utility function is used. The developed heuristic algorithm presents a good solution. Through a numerical example, the procedures of the job sequencing is explained.

• 한국시뮬레이션학회논문지
• /
• 제24권4호
• /
• pp.77-88
• /
• 2015

본 논문은 작업별 위치기반 지수학습 효과를 갖는 2-에이전트 단일기계 스케줄링 문제를 고려한다. 에이전트 A는 가중 완료 시간의 합을 최소화하며, 에이전트 B는 총소요시간에 대한 상한 값을 만족하는 조건을 갖는다. 본 연구에서는 먼저 우수해/가능해에 대한 특성을 개발하고, 이를 이용하여 최적 해를 찾기 위한 분지한계 알고리즘을 설계한다. 또한 근사 최적 해를 구하기 위해 6가지 다른 초기해 생성 방법을 이용한 시뮬레이티드 어닐링 알고리즘을 제안한다. 수치 실험을 통해 제안된 알고리즘의 우수한 성능을 검증한다. 실험 결과, 다른 초기해 생성 방법들 간에는 %errors 차이가 유의하게 발생하지 않았으며, 에이전트 A의 작업 순서를 무작위로 생성할 때 성능이 좋아짐을 발견하였다. 반면에, 에이전트 B의 초기해 생성 방법은 성능에 영향을 미치지 않았다.

• 산업경영시스템학회지
• /
• 제38권3호
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2017년도 추계학술대회
• /
• pp.270-273
• /
• 2017

플라스틱 사출물의 불량 감소 및 사이클 타임 축소를 통한 생산성 향상은 사출업계의 오랜 숙원 사항이다. 특히 중국 등 후발 주자의 추격과 좁혀지지 않는 독일, 일본과의 기술격차 사이에 끼어 있는 국내 사출업계에게 생산성 향상은 매우 절실하다. 30여년 국내 사출업계의 연구와 경험을 통해 금형 내 사출물 표면 온도 제어가 품질 관리의 핵심임을 알게 되었고 PID 제어 등 고급제어 기법을 활용한 다양한 시도가 있었으나 독일, 일본의 유수 업체의 생산성에는 아직 부족하다. 이에 근사알고리즘 중 "Knapsack"개념과 "Minimum Makespan Scheduling"기법을 활용하여 PID 제어로 풀기 어려운 수렴하지 않고 주기적인 반복 데이터 패턴을 지닌 대상을 효율적으로 제어할 수 있는 방법을 소개하고 또한 실제 사출 현장에서 추출한 데이터 분석으로 사출품의 생산성 향상에 근사알고리즘을 이용한 제어가 충분히 효과적임을 제시하고자 한다.

• 산업경영시스템학회지
• /
• 제38권4호
• /
• pp.132-141
• /
• 2015

We focus on the fire scheduling problem (FSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing makespan to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We develop several dominance properties and a lower bound for the problem, and suggest a branch and bound algorithm implementing them. Also, In addition, heuristic algorithms that can be used for obtaining an initial upper bound in the B&B algorithm and for obtaining good solutions in a short time were developed. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithm solves problems of a medium size in a reasonable amount of computation time. The proposed lower bound, the dominance properties, and the heuristics for upper bound are tested in B&B respectively, and the result showed that lower bound is effective to fathoming nodes and the dominance properties and heuristics also worked well. Also, it is showed that the CPU time required by this algorithm increases rapidly as the problem size increases. Therefore, the suggested B&B algorithm would be limited to solve large size problems. However, the employed heuristic algorithms can be effectively used in the B&B algorithm and can give good solutions for large problems within a few seconds.