• 산업경영시스템학회지
• /
• 제8권11호
• /
• pp.45-56
• /
• 1985

This thesis studies the order release scheduling by lead time offsetting technique in MRP system. MRP is the process of working backward from the scheduled completion dates of end products or major assemblies to determine the dates and quantities when the various component parts and materials are to be ordered. It aims getting the right quantity of component parts to the right places at the right time with a schedule that puts each parts or subassembly into stock shortly ahead of the need for that parts or subassembly. The planned order release point of a item can be easily decided when the scheduled completion date and planned lead time is certain and known before by lead time offsetting technique in MRP system.

• 대한산업공학회지
• /
• 제33권2호
• /
• pp.254-264
• /
• 2007

This paper considers a scheduling problem to minimize the total weighted completion time 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 components, each component is machined on the fabrication machine specified in advance. The manufactured components of each job are subsequently assembled into a final product on the final-assembly machine. The objective of this paper is to find the optimal schedule minimizing the total weighted completion time of jobs. Three lower bounds are derived and tested in a branch-and-bound (B&B) Procedure. Also, three heuristic algorithms are developed based on the greedy strategies. Computational results show that the proposed B&B procedure is more efficient than the previous work which has considered the same problem as this paper.

• 융합정보논문지
• /
• 제11권8호
• /
• pp.207-211
• /
• 2021

이 논문은 단계 1에 기계 한 대, 단계 2에 2대의 병렬 기계가 있는 유연 흐름 생산 스케줄링 문제를 다룬다. 목적 함수는 평균 완료 시간을 최소화하는 것이다. 이 문제를 혼합 정수 2차 문제로 정식화하여 혼합 시뮬레이티드 어닐링을 이용하여 풀었다. 혼합 시뮬레이티드 어닐링은 유전자 알고리즘의 탐색 능력을 이용하고 시뮬레이티드 어닐링을 적용하여 너무 이른 수렴 현상을 줄이는 방법이다. 실험을 통하여 혼합 시뮬레이티드 어닐링의 성능을 평가하였다.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.283-293
• /
• 2007

This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.

• 대한산업공학회지
• /
• 제33권1호
• /
• pp.76-85
• /
• 2007

A reliability acceptance sampling plan (RASP) consists of a set of life test procedures and rules for eitheraccepting or rejecting a collection of items based on the sampled lifetime data. Most of the existing RASPs areconcerned with the case where test items are available at the same time. However, as in the early stage ofproduct development, it may be difficult to secure test items at the same time. In such a case, it is inevitable toconduct a life test using sequentially supplied samples.In this paper, it is assumed that test items are sequentially supplied, the lifetimes of test items follow anexponential disthbution, failures are monitored continuously, arrival times of test items are known, and thenumber of test items at each arrival time is given. Under these assumptions, RASPs are developed by deter-mining the test completion time and the critical value for the maximum likelihood estimator of the mean lifetimesuch that the producer and consumer risks are satisfied. Then, the developed plans are compared to thetraditional Type-I censored RASPs in terms of the test completion time. Computational results indicate that thetest completion time of the developed RASP is shorter than that of the traditional Type-I censored plan in mostcases considered. It is also found that the superiority of the developed RASP becomes more prominent as theinter-arrival times of test items increase and/or the total number of test items gets larger.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.343-352
• /
• 1993

In this study, a modified algorithm for the exchange heuristic is developed and applied to a resource-constrained scheduling problem. The problem involves multiple projects and multiple resource categories and allows flexible resource allocation to each activity. The objective is to minimize the maximum completion time. The exchange heuristkc is a multiple pass algorithm which makes improvements upon a given initial feasible schedule. Four different modified algorithms are proposed. The original algorithm and the new algorithms were compared through an experimental investigation. All the proposed algorithms reduce the maximum completion time much more effectively than the original algorithm. Especially, one of four proposed algorithms obviously outperforms the other three algorithms. The algorithm of the best performance produces significantly shorter schedules than the original algorithm, though it requires up to three times more computation time. However, in most situations, a reduction in schedule length means a significant reduction in the total cost.

• 대한산업공학회지
• /
• 제20권1호
• /
• pp.15-25
• /
• 1994

The Bayesian approach to reliability acceptance sampling has several advantages over the non-Bayesian approach. For instance, the former usually requires less amount of testing time and smaller sample sizes than the latter. In this article, a Bayesian acceptance sampling plan(ASP) based on a failure-free period life test is developed under the assumption of exponential lifetime distribution, and is compared with the corresponding Bayesian hybrid ASP in terms of the expected completion time. It is found that the proposed ASP tends to have a smaller expected completion time than the Bayesian hybrid ASP as the prior assessment of the reliability of a lot becomes optimistic, and vice versa. Tables of failure-free period Bayesian ASP's are also included.

• Journal of information and communication convergence engineering
• /
• 제17권4호
• /
• pp.279-284
• /
• 2019

This paper presents processing-node status-based message scattering and gathering algorithms for multi-processor systems on chip to reduce the communication time between processors. In the message-scattering part of the message-passing interface (MPI) scatter function, data transmissions are ordered according to the proposed linear algorithm, based on the processor status. The MPI hardware unit in the root processing node checks whether each processing node's status is 'free' or 'busy' when an MPI scatter message is received. Then, it first transfers the data to a 'free' processing node, thereby reducing the scattering completion time. In the message-gathering part of the MPI gather function, the data transmissions are ordered according to the proposed linear algorithm, and the gathering is performed. The root node receives data from the processing node that wants to transfer first, and reduces the completion time during the gathering. The experimental results show that the performance of the proposed algorithm increases at a greater rate as the number of processing nodes increases.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(I)
• /
• pp.288-292
• /
• 1987

The purpose of this paper is to develope the parallel computation algorithm that enables it to minimize the completion tine of computation execution of the entire subtasks, under the constraints of the series-parallel precedence relation in each subtask. The developed algorithm was applied to the control of a robot manipulator functioned by multi-CPU's and to obtain the minimum time schedule so that real time control may be achieved. The completion time of computation execution was minimized by applying "Variable" Branch and Bound algorithm which was developed In this paper in determining the optimum ordered schedule for each CPU.

• 전기학회논문지
• /
• 제61권1호
• /
• pp.148-154
• /
• 2012

For a successful checkpointing strategy, we should place checkpoints so as to optimize fault-tolerance capability of real-time systems. This paper presents a novel scheme of checkpoint placement for real-time systems with periodic multi-tasks. Under the influence of transient faults, multi-tasks are scheduled by the Rate Monotonic (RM) algorithm. The optimal checkpoint intervals are derived to maximize the probability of task completion. In particular, this paper is concerned about the general case that the deadline of a task is longer than the period. Compared with the special condition that the deadline is equal to or less than the period, this general case causes a more complicate test procedure for schedulability of the RM algorithm with respect to a given set of checkpoint re-execution vectors. The probability of task completion is also derived in a more complex form. A case study is given to show the applicability of the proposed scheme.