• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.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.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.1
• /
• pp.101-105
• /
• 2011

In case of high-tech process industries such as semiconductor and TFT-LCD manufactures, fault of a virtually finished product that is value-added one, since it has gone throughout the most of processes, may give rise to quality cost nearly amount to its selling price and can be a main cause that decreases the efficiency of manufacturing process. This paper proposes a real-time dispatching algorithm for semiconductor manufacturing process with rework. In order to evaluate the proposed algorithm, this paper examines the performance of the proposed method by comparing it with that of the existing dispatching algorithms, based on various experimental data.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.91-100
• /
• 2016

In this research, emergency vehicle dispatching problems faced with in the wake of massive natural disasters are considered. Here, the emergency vehicle dispatching problems can be regarded as a single machine stochastic scheduling problems, where the processing times are independently and identically distributed random variables, are considered. The objective of minimizing the expected number of tardy jobs, with distinct job due dates that are independently and arbitrarily distributed random variables, is dealt with. For these problems, optimal static-list policies can be found by solving corresponding assignment problems. However, for the special cases where due dates are exponentially distributed random variables, using a proposed dynamic programming approach is found to be relatively faster than solving the corresponding assignment problems. This so-called Pivot Dynamic Programming approach exploits necessary optimality conditions derived for ordering the jobs partially.

• Industrial Engineering and Management Systems
• /
• v.1 no.1
• /
• pp.10-18
• /
• 2002

A more comprehensive analytical framework for examining the relative merits of alternative dispatching process policies for nurseries is developed in this paper. The efficiency of the dispatch process of plants in a nursery is analysed using a vehicle routing model. The problem then involves determining in what order each vehicle should visit its locations. The problem is NP-hard. Several heuristic techniques are used to solve a real life nursery sequencing problem. The results obtained by these heuristic techniques are compared with each other and the current sequencing of orders. The model with some minor alterations can be also used to minimise the dispatching and collecting process in different agricultural plants.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.329-338
• /
• 2007

This paper presents a dispatching algorithm for nonidentical parallel machines problem considering rework, sequence dependent setup times and release times. For each pair of a machine and a job type, rework probability of each job on a machine can be known through historical data acquisition. The heuristic scheduling scheme named by EDDR (Earliest Due Date with Rework probability) algorithm is proposed in this paper making use of the rework probability. The proposed dispatching algorithm is measured by two objective function value: 1) total tardiness and 2) the number of reworked jobs, respectively. The extensive computational results show that the proposed algorithm gives very efficient schedules superior to the existing dispatching algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.1095-1100
• /
• 2010

Customer satisfaction is a main issue in the modern competitive industrial environment. So quality and productivity are the most important requisites. This paper presents a method for effective real time dispatching for parallel machines with multi product that minimizes mean tardiness and maximizes the quality of the product. In this paper, the effectiveness of the method has been examined in the simulation and compared with other dispatching methods. Using this method presented in this paper, companies can improve customer satisfaction.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.77-85
• /
• 2000

One form of job shop scheduling problem in contemporary automated manufacturing such as flexible manufacturing systems (FMS's) is presented which we call the FMS dispatching priority problem. The FMS dispatching priority problem seeks the best dispatching priority of parts and operations, and is essentially a combinatorial optimization problem. Because of the complicated mechanism of the system, the performance of a given dispatching priority must be evaluated via simulation. Simulated annealing have been applied to the problem, and it is found that appropriate parameter setting will be desirable to get good, if not the optimal, solutions within a limited amount of time under the presence of heavy computational burden due to simulation. More specifically, experiments reveal that initial temperature is the single most important factor among other parameters and factors, and that the appropriate initial temperature depends on the allowable computer time in such a way that the less time one can afford to spend, the lower the appropriate initial temperature should be.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.28-28
• /
• 1992

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.78-86
• /
• 2015

Up-to-date business environment for manufacturers is very complex and rapidly changing. In other words, companies are facing a variety of changes, such as diversifying customer requirements, shortening product life cycles, and switching to small quantity batch production. In this situation, the companies are introducing the concept of JIT (just-in-time) to solve the problem of on-time production and on-time delivery for survival. Though many companies have introduced ERP (enterprise resource planning) systems and MRP (material requirement planning) systems, the performance of these systems seems to fall short of expectations. In this paper, the case study on introducing an APS (advanced planning and scheduling) system based on dispatching rules to a machining company and on finding a method to establish an efficient production schedule is presented. The case company has trouble creating an effective production plan and schedule, even though it is equipped with an MRP-based ERP system. The APS system is applied to CNC (computer numerical control) machines, which are key machines of the case company. The overall progress of this research is as follows. First, we collect and analyze the master data on individual products and processes of the case company in order to build a production scheduling model. Second, we perform a pre-allocation simulation based on dispatching rules in order to calculate the priority of each order. Third, we perform a set of production simulations applying the priority value in order to evaluate production lead time and tardiness of pre-defined dispatching rules. Finally, we select the optimal dispatching rule suitable for work situation of the case company. As a result, an improved production schedule leads to an increase in production and reduced production lead time.

• Journal of Navigation and Port Research
• /
• v.32 no.10
• /
• pp.837-844
• /
• 2008

In an automated container terminal, various factors affect the operation of container handling equipment such as quay cranes and AGVs, and thus calculating the exact operation time is nearly infeasible. This uncertainty makes it difficult to dispatch AGVs well. In this paper, we propose a simulation-based AGV dispatching algorithm When dispatching an AGV to an operation, the proposed algorithm conducts multiple stochastic simulation for the succeeding AGV operations for the predetermined period to collect stochastic samples of the result of the dispatching. In the stochastic simulation, the uncertainty of crane operations is represented as a simple probability distribution and the operation time of a crane is determined according to this. A dispatching option is evaluated by the total delay time of quay cranes which is estimated by averaging the quay crane delay of each simulation In order to collect a sufficient number of samples that guarantee the credibility of the evaluation, we devised a high-speed simulator that simulates AGV operation The effectiveness of the proposed algorithm is validated by simulation experiments.