• 산업경영시스템학회지
• /
• 제32권1호
• /
• pp.72-78
• /
• 2009

This paper considers a multiagent scheduling problem under public information where a machine is shared by multiple agents. Each agent has a local objective among the minimization of total completion time and the minimization of maximum. In this problem, it is assumed that scheduling information is public. Therefore an agent can access to complete information of other agents and pursue efficient schedules in a centralized manner. We propose an enumeration scheme to find Pareto optimal schedules and a multiobjective genetic algorithm as a heuristic approach. Experimental results indicate that the proposed genetic algorithm yields close-to Pareto optimal solution under a variety of experimental conditions.

• 경영과학
• /
• 제30권1호
• /
• pp.15-24
• /
• 2013

We consider the single machine scheduling problem with a rate-modifying activity and time-dependent deterioration after the activity. The class of scheduling problems with rate-modifying activities and the class of scheduling problems with time-dependent processing times have been studied independently. However, the integration of these classes is motivated by human operators of tasks who has fatigue while carrying out the operation of a series of tasks. This situation is also applicable to machines that experience performance degradation over time due to mal-position or mal-alignment of jobs, abrasion of tools, and scraps of operations, etc. In this study, the integration of the two classes of scheduling problems is considered. We present a mathematical model to determine job-sequence and a position of a rate-modifying activity for the integration problem. Since the model is difficult to solve as the size of real problem being very large, we propose genetic algorithms. The performance of the algorithms are compared with optimal solutions with various problems.

• Industrial Engineering and Management Systems
• /
• 제15권1호
• /
• pp.11-18
• /
• 2016

This paper considers a scheduling problem in a flexible job shop with a reconfigurable manufacturing cell. The flexible job shop has both operation and routing flexibilities, which can be represented in the form of a multiple process plan, i.e. each part can be processed through alternative operations, each of which can be processed on alternative machines. The scheduling problem has three decision variables: (a) selecting operation/machine pairs for each part; (b) sequencing of parts to be fed into the reconfigurable manufacturing cell; and (c) sequencing of the parts assigned to each machine. Due to the reconfigurable manufacturing cell's ability of adjusting the capacity, functionality and flexibility to the desired levels, the priority scheduling approach is proposed in which the three decisions are made at the same time by combining operation/machine selection rules, input sequencing rules and part sequencing rules. To show the performances of various rule combinations, simulation experiments were done on various instances generated randomly using the experiences of the manufacturing experts, and the results are reported for the objectives of minimizing makespan, mean flow time and mean tardiness, respectively.

• 대한산업공학회지
• /
• 제40권3호
• /
• pp.305-312
• /
• 2014

This research deals with a problem that minimizes makespan in a non-identical parallel machine system with sequence and machine dependent setup times and machine dependent processing times. We first present a new mixed integer programming formulation for the problem, and using this formulation, one can easily find optimal solutions for small problems. However, since the problem is NP-hard and the size of a real problem is large, we propose four heuristic algorithms including genetic algorithm based heuristics to solve the practical big-size problems in a reasonable computational time. To assess the performance of the algorithms, we conduct a computational experiment, from which we found the heuristic algorithms show different performances as the problem characteristics are changed and the simple heuristics show better performances than genetic algorithm based heuristics for the case when the numbers of jobs and/or machines are large.

• Industrial Engineering and Management Systems
• /
• 제15권1호
• /
• pp.32-40
• /
• 2016

This paper considers a special case of a three machine flow shop scheduling problem in which operation processing time of each job is ordered such that machine 1 has the longest processing time, whereas machine 3, the shortest processing time. The objective of the problem is the minimization of the total completion time. Although the problem is simple, its complexity is yet to be established to our best knowledge. This paper first introduces the problem and presents some optimal properties of the problem. Then, it establishes several special cases in which a polynomial-time optimal solution procedure can be found. In addition, the paper proves that the recognition version of the problem is at least binary NP-complete. The complexity of the problem has been open despite its simple structure and this paper finally establishes its complexity. Finally, a simple and intuitive heuristic is developed and the tight worst case bound on relative error of 6/5 is established.

• 한국정보처리학회논문지
• /
• 제6권10호
• /
• pp.2659-2669
• /
• 1999

This paper a heuristic, clustering based task allocation scheme applicable to non-directed task graph on a distributed system. This scheme firstly builds a task-machine graph, and then applies a clustering process where in a pair of tasks that are connected to the highest cost edge is merged into a big one or a task is allocated to a machine. During the process, the proposed scheme figure out a machine onto which the task allocation may cause deduction of large communication overhead that has incurred between the task and tasks that are already allocated to the machine while the computation costs is slightly increased in the machine. Simulation for the various task graphs shows that the scheduling using the proposed scheme result far better than ones by using the traditional schemes. A comparison with optimal task scheduling also promises that our scheme derives optimal results more occasionally than the traditional schemes do.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2003년도 추계학술대회 및 정기총회
• /
• pp.85-88
• /
• 2003

In case that any jobs in a Job Shop can be scheduled on more than one machine and may have flexible operation sequences, with considering such case it is very difficult and complex to make the optimal process plans and scheduling. But they should be considered for an integrated model to perform more effective process planning and scheduling in this job shop problem. In this paper, we propose GA-based scheduling method to integrate effectively the problem of alternative machines, alternative operation sequences and scheduling. The performance of proposed GA is evaluated through comparing integrated scheduling with not integrated scheduling in molding company with alternative machines and operation sequences. Also, we use benchmark problems to evaluate performance. The scheduling method in this research will apply usefully to real world scheduling problems.

• 스마트미디어저널
• /
• 제5권4호
• /
• pp.18-25
• /
• 2016

가상화 기술에 의해 추상화된 자원은 하드웨어적으로 효율적으로 사용 할 수 있어 관리가 용이하며, 이로 인해 클라우드 시스템과 대형 서버 클러스터 구축 등에 가상 머신 모니터가 널리 사용되고 있다. 가상화된 시스템의 성능은 가상머신 스케줄러의 영향을 크게 받는다. 하지만, 기존의 가상 머신에서 사용하는 Credit 스케줄러는 스케줄링 지연 시간이 길어질 경우, I/O 응답성이 저하되는 문제점이 있다. 본 논문에서는 가상머신의 이벤트 응답성 저하 현상을 개선하기 위해 기존 가상머신의 Credit 스케줄러에 대출/상환 기법을 도입하였다. 제안 기법은 가상 머신에 I/O 이벤트 처리를 위한 credit을 대출해주고, 대출 credit의 소비 패턴을 분석하여 각 가상머신의 태스크 특징을 분류한다. I/O 이벤트가 도착했을 때, 분석된 태스크 특징을 기반으로 일시적으로 가상 머신의 스케줄링 우선순위를 높임으로써 시스템의 I/O 성능을 향상시킨다. 제안 기법을 가상머신 모니터에 구현하였으며, 기존 가상머신의 Credit 스케줄러 대비 제안된 기법을 적용한 가상머신의 I/O 평균 응답성과 대역폭이 각 60%, 62% 향상되었다.

• 산업경영시스템학회지
• /
• 제20권44호
• /
• pp.197-205
• /
• 1997

Manufacturers can meet the due dates of orders by using overtime, in which case, additional cost incurs for the amount of overtime. Although many studies have been reported on scheduling, only a few papers are founds on production scheduling using overtime. We consider the problem of production scheduling using overtime on a single machine, in which each job has a given due-date, a constant processing time. We assume that the daily overtime does not exceed the daily regular operation time. The objectives is to minimize the total overtimes, while meeting all due dates. We first present a mathematical model, and then suggest a heuristic algorithm for the problem.

• 산업경영시스템학회지
• /
• 제47권1호
• /
• pp.20-27
• /
• 2024

Determining the number of operators who set up the machines in a human-machine system is crucial for maximizing the benefits of automated production machines. A man-machine chart is an effective tool for identifying bottlenecks, improving process efficiency, and determining the optimal number of machines per operator. However, traditional man-machine charts are lacking in accounting for idle times, such as interruptions caused by other material handling equipment. We present an adjusted man-machine chart that determines the number of machines per operator, incorporating idleness as a penalty term. The adjusted man-machine chart efficiently deploys and schedules operators for the hole machining process to enhance productivity, where operators have various idle times, such as break times and waiting times by forklifts or trailers. Further, we conduct a simulation validation of traditional and proposed charts under various operational environments of operators' fixed and flexible break times. The simulation results indicate that the adjusted man-machine chart is better suited for real-world work environments and significantly improves productivity.