• 한국경영과학회지
• /
• 제19권2호
• /
• pp.107-118
• /
• 1994

This research is concerned with production scheduling for a flexible manufacturing cell which consists of two machine centers with unlimited buffer space and a single automatic guided vehicle. The objective is to develop and evaluate heuristic scheduling procedures that minimize maximum completion time. A numerical example illustrates the proposed algorithm. The heuristic algorithm is implemented for various cases by SLAM II. The results show that the proposed algorithm provides better solutions than Johnson's. It also gets good solutions to minimize mean flowtime.

• 경영과학
• /
• 제10권2호
• /
• pp.61-77
• /
• 1993

This paper involves a study of developing the production scheduling system in a general job shop type mechanical factory. We consider realistic situations in the job-shop environments, such as alternative machines for operation, the new kinds of processes, the machining center with the plural pallet, the operational situation of each machine during the scheduling period, occurings of urgent orders and machine breakdowns. We also propose the methodology of re-schedule. It is very fast and acceptable for real time production control system. These all functions are implemented on IBM PC and program source is written in PASCAL language.

• 한국경영과학회지
• /
• 제26권2호
• /
• pp.1-11
• /
• 2001

This paper considers the scheduling of cell-based handoffs to balance the traffic in a fiber-optic microcelluar system. In the system depending on the order of cell based handoff, periodical balancing of the traffic among microcells can be achieved. The cell based handoff problem is formulated as a dynamic programming and the computational complexity is analyzed. Since the scheduling problem requires real time solution, heuristic algorithms are proposed and the computational results are discussed.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.209-213
• /
• 1998

Job-Shop Scheduling 문제는 전형적인 NP-hard 문제로서 효율적인 발견적 기법을 필요로 한다. 본 연구에서는 이 문제에 대한 유전알고리즘들의 성능을 비교 분석한다. 유전 알고리즘의 주요 구성 요소들로는 크게 선별, 교차, 돌연변이 등이 존재하는데, 특히 선별은 적자 생존의 자연 법칙에 기초하여, 환경에 대한 적응도에 의해 현 세대의 모집단으로부터 다음 세대에 생존할 개체를 선택하는 과정으로 해의 산출에 중요한 역할을 하는 부분이다. 기존의 많은 연구들이 유전 연산자인 교차, 돌연변이 방법들에 대한 성능 비교에 초점을 맞추었는데, 본 연구에서는 선별 과정에 초점을 맞추어 기존의 알려진 여러 선별 방법 들을Job-Shop Scheduling 문제에의 적용을 통해 비교 분석하고 새로운 선별 방법을 제안한다.

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

The purpose of this study is developing scheduling logic and program for machining scheduling of automobile part production line with unbalanced processing time. Three rules are developed to minimize slack and effect on other job. Fourth rule is suggested which considered weighted sum of three factors. schedule is generated totally 1, 000 times and then optimal weight parameter is selected. The program is developed to schedule situation to compare with the performance measure, total finish time of machine and total tardiness of part. As a result, the rule which considered weighted sum of three factors is effective for both measure.

• 경영과학
• /
• 제12권3호
• /
• pp.177-185
• /
• 1995

This paper presents a Tabu Search method to minimize a number of tardy jobs in the nonidentical parallel machine scheduling. The Tabu Search method employs a restricted neighborhood for the reduction of computation time. In this paper, we use two different types of method for a single machine scheduling. One is Moore's algorithm and the other is insertion method. We discuss computational experiments on more than 1000 test problems.

• 한국경영과학회지
• /
• 제18권2호
• /
• pp.105-130
• /
• 1993

This study deals with finding a schedule for the movement of a material handling device (elevator) in a manufacturing plant. Two different algorithm (Traveling Salesman Technique and Greedy Algorithm) are used in the scheduling of the elevators using a simulation technique to determine the proper method of scheduling the elevator movement. Based on the simulation analysis, we have found that the Greedy algorithm serves better than the algorithm based on Traveling Salesman technique for scheduling the movement of a material handling device in the manufacturing plant.

• 품질경영학회지
• /
• 제19권2호
• /
• pp.125-132
• /
• 1991

This paper is concerned with the flow shop scheduling problems considering different weighted penalty costs for earliness and lateness, and a common due date. The objective of the paper is to develop an efficient heuristic scheduling algorithm for minimizing total penalty costs and for determining the optimal common due date. The positional weight index and, the product sum method are used. A numerical example is given for illustrating the proposed algorithm.

• 경영과학
• /
• 제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.

• 대한안전경영과학회지
• /
• 제2권2호
• /
• pp.85-94
• /
• 2000

This paper deals with the selection of a proper dispatching rule for an one-process Job scheduling that follows a particular distribution of an order production. That is, it makes a distribution on an order per unit period and applies to simulation model that uses it. This study consists of two purposes either seeks adequately production scheduling using priority rule or seeks extension of the facilities that increase current production efficiency through computer simulation in scheduling.