• 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.

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.81-89
• /
• 1997

This study is concerned with the scheduling problems in flexible manufacturing systems(FMSs). The scheduling problem in FMSs is a complex one when the number of machines and jobs are increased. Thus, a heuristic method is recommended in order to gain near-optimal solutions in a practically acceptable time. The purpose of this study is to develope a machine and AGV dispatching algorithm. The proposed dispatching algorithm is a on-line scheduling algorithm considering the due date of parts and the status of the system in the scheduling process. In the new machine and AGV dispatching algorithm, a job priority is determined by LPT/LQS rules considering job tardiness. The proposed heuristic dispatching algorithm is evaluated by comparison with the existing dispatching rules such as LPT/LQS, SPT/LQS, EDD/LQS and MOD/LQS. The new dispatching algorithm is predominant to existing dispatching rules in 100 cases out of 100 for the mean tardiness and 89 cases out of 100 for the number of tardy jobs.

• 대한산업공학회지
• /
• 제35권4호
• /
• pp.218-225
• /
• 2009

This paper considers a parallel-machine scheduling problem with job release times and sequence-dependent setup times. The objective of this problem is to determine the allocation policy of jobs and the scheduling policy of machines so as to minimize the weighted sum of setup times, delay times, and tardy times. A mathematical model for optimal solution is derived and a meta heuristic algorithm based on the improved ant colony system is proposed in this paper. The performance of the meta heuristic algorithm is evaluated through compare with optimal solutions using randomly generated several examples.

• International journal of advanced smart convergence
• /
• 제12권4호
• /
• pp.126-133
• /
• 2023

Recent advancements in cloud service virtualization technologies have witnessed a shift from a Virtual Machine-centric approach to a container-centric paradigm, offering advantages such as faster deployment and enhanced portability. Container orchestration has emerged as a key technology for efficient management and scheduling of these containers. However, with the increasing complexity and diversity of heterogeneous workloads and service types, resource scheduling has become a challenging task. Various research endeavors are underway to address the challenges posed by diverse workloads and services. Yet, a systematic approach to container orchestration for effective cloud management has not been clearly defined. This paper proposes the DRA-Engine (Dynamic Resource Allocation Engine) for resource scheduling in container orchestration. The proposed engine comprises the Request Load Procedure, Required Resource Measurement Procedure, and Resource Provision Decision Procedure. Through these components, the DRA-Engine dynamically allocates resources according to the application's requirements, presenting a solution to the challenges of resource scheduling in container orchestration.

• 산업공학
• /
• 제13권3호
• /
• pp.388-395
• /
• 2000

In this paper, we propose an approach for integrated process planning and scheduling through analysis of the alternative operations sequences and machine selection in supply chain with multiple plants. It takes into account such factors alternative machine, alternative operations sequences, setup time, transportation time between plants, along with other manufacturing factors. The objective of the model is to minimize makespan of machine schedules for all parts, determines operations sequence for each part, and selects a machine for each operation simultaneously. Examples are presented to demonstrate the effectiveness of the proposed approach.

• 산업경영시스템학회지
• /
• 제33권4호
• /
• pp.153-158
• /
• 2010

This study presents a single machine scheduling algorithm to minimize total cost(lateness cost, earliness cost and failure cost) by controlling machining speed. Generally, production scheduling uses the information of process planning and machining speed is not changed at production scheduling. And failure cost is not consider for scheduling algorithm. Therefore, the purpose of this study is to consider the change of machining speed for efficient production scheduling. And performance criteria for algorithm considers total cost. Especially, failure cost of product by increasing machining speed is considered.

• 한국국방경영분석학회지
• /
• 제24권2호
• /
• pp.162-169
• /
• 1998

This study presents an single machine scheduling algorithm minimize lateness of product by controlling machining speed. Generally, production scheduling uses the information of process planning. But the production scheduling algorithm has not considered the control of machining speed in its procedures. Therefore, the purpose of this study is to consider the machining speed in production scheduling algorithm for efficient production scheduling. Machining time and machining cost required to manufacture a piece of a product are expressed as a unimodal convex function with respect to machining speed, so it has minimal point at minimum time speed or the minimum cost speed. Therefore, because of considering the machining cost, the control of machining speed for the algorithm is executed between minimum speed and maximum speed. An example is demonstrated to explain the algorithm.

• 산업경영시스템학회지
• /
• 제25권3호
• /
• pp.41-49
• /
• 2002

In the study, for the practical approaches of job shop scheduling, we propose the new dispatching rules of job shop scheduling in order to complement the practical applications in the existing researches. The assumed situation for the practical approaches considers the following; relaxation of assumption for capacity constraint by machine flexibility, the addition of the common use of jig and fixture, unbalanced machine workloads and duedate tightness, and produces fast rescheduling that reflects unexpected situations. The performance of the new dispatching rules is compared and analyzed with the existing methods through the computer experiments in the assumed conditions. The results can be useful to improving a field application of the job shop scheduling.

• 한국컴퓨터정보학회논문지
• /
• 제19권6호
• /
• pp.101-108
• /
• 2014

병렬 머신 스케줄링은 주어진 작업들의 총 완료 시간이 최소가 되도록 작업들을 병렬 머신들에 할당하는 문제로 강철 산업, 반도체 제조, 플라스틱 산업 등 다양한 제조 시스템 분야에서 활용되고 있다. 각 작업들은 준비 과정과 처리 과정을 거치게 되는데, 응용 분야에 따라 제거 과정이 필요한 경우도 있다. 이 중 처리 과정은 병렬 머신만 사용되는데 비해, 준비 과정이나 제거 과정은 서버와 병렬 머신이 동시에 사용된다. 기존의 연구들은 단일 서버를 사용하거나 준비 과정과 처리 과정만을 고려하는 연구가 대부분인데, 단일 서버를 사용하는 경우에는 서버에 병목 현상이 발생하게 되어 총 완료 시간이 늦어지게 되고, 병렬 머신의 수를 증가시키더라도 총 완료 시간은 별로 향상되지 않는 단점을 가지게 된다. 본 연구에서는 다중 서버를 사용하고 준비 과정, 처리 과정, 제거 과정을 모두 고려하는 병렬 머신 스케줄링 알고리즘을 제안하고, 서버의 수와 병렬 머신의 수가 총 완료 시간에 어떤 영향을 미치는지 실험을 통해 분석하였다.

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