• Journal of the Korea Safety Management & Science
• /
• v.8 no.6
• /
• pp.139-147
• /
• 2006

In case of domestic automobile manufacturers introducing and running a make-to-order production system, JIT system is to provide a necessary number of components at a right place in time which is a specific supply chain management, is different from other occupations. This study is for establishing a efficient production planning and finding a management method to correspond with a manufacturing system and diversified supply chain management and building an information system to support it. For this, we analyze the relevant business process and utilize various informations occur in supply chain of domestic automobile components manufacturer. It will contribute to not only reliability improvement of production management system but also satisfaction for due date of products.

• IE interfaces
• /
• v.13 no.3
• /
• pp.512-520
• /
• 2000

An integrated process planning and scheduling model considering outsourcing in manufacturing supply chain is proposed in this paper. The process planning and scheduling considering outsourcing are actually interrelated and should be solved simultaneously. The proposed model considers the alternative process plans for job types, precedence constraints of job operations, due date of production, transportation time and production information for outsourcing. The integrated states include:(1) Operations sequencing, (2) Machine selection, (3) Scheduling with outsourcing under the due date. To solve the model, a heuristic approach based on genetic algorithm(GA) is developed. The proposed approach minimizes the makespan considering outsourcing and shows the best operation-sequences and schedule of all jobs.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.257-260
• /
• 2001

The primary objective of Supply Chain Management (SCM) is to optimize the cash, material and information flow considering all components of Supply Chain (SC) . The plan, established for achieving such objective, is called Supply Chain Planning (SCP) . This SCP gives each SC component specific volume or operation task, should be done in specific due date, for optimizing SC. In detail, the degree of accomplishment for SCP, depends on the SCP achievement of each SC components, is very close to successful SCM. However, this achievement is affected by uncertainties about time and volume. In general, reliability concepts means the probability that a product or system will perform its specified function under prescribed conditions without failure for a specified period of time. Therefore, the concept of Supply Chain Reliability (SCR) and an analytic methodology to calculate the degree of achievement SCP using reliability concept are proposed in this paper. SCR means that the degree of achievement for SCP considering all SC components in due date. SCR can be used to measure the performance of whole supply chain and indicate the direction of SCP.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.1
• /
• pp.3-16
• /
• 1995

JIT manufacturing requires that materials and services should be done neither too early nor tardy. Therefore, related jobs have to be performed just-in-time. In this paper, we consider a problem of determining a schedule of jobs with a common due date. The objective is to minimize the squared deviation of complete times from the due date. An artificial neural network which is based on the mean field theory is proposed for the problem. Computational results obtained from computer simulations show that the network performs very well.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.295-298
• /
• 1996

We consider a nonpreemptive single-machine scheduling problem to minimize the mean squared deviation(MSD) of job completion times about a common due date d with a maximum tardiness constraint, i.e., maximum tardiness is less than or equal to the given allowable amount, .DELTA.(MSD/T$_{max}$ problem). We classify the .DELTA.-unconstrained cases in the MSD/T$_{max}$ problem. We provide bounds to discern each case for the problem. It is also shown that the .DELTA.-unconstrained MSD/T$_{max}$ problem is equivalent to the unconstrained MSD problem and the tightly .DELTA.-constrained MSD/T$_{max}$ problem with n jobs and a maximum allowable tardiness .DELTA. can be converted into the constrained MSD problem with a common due date .DELTA. and n-1 jobs. Finally, the solution procedure for MSD/T$_{max}$ problem is provided. provided.

• Journal of the military operations research society of Korea
• /
• v.22 no.2
• /
• pp.153-165
• /
• 1996

This paper presents an order releasing algorithm for an AMS. Order release policy determine order releasing time to shop floor so as to improve order management and shop performance. The proposed order releasing algorithm can cope with the dynamic environment of orders(e.g. change or cancel of order) flexibly and fastly, by processing individual order and exchanging the information(e.g. compeletion time or lateness of order, etc) with customer. And the objective of the order releasing algorithm is the observance of the due-date, therefore, it can provide customer with a reliability of order. Computer simulation is used to obtain the makespan of order which is the input data of the order releasing algorithm. The eight candidate part dispatching rules are simulated to selected an effective part dispatching rule for the computer simulation. By using the best effective part dispatching rule, the computer simulation is conducted to determine order releasing time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.143-151
• /
• 1990

This paper studies a single machine scheduling problem in which all jobs have the common due date and penalties are assessed for jobs at different rates. The scheduling objective is to minimize the weighted mean absolute deviations(WMAD). This problem may provide greater flexibility in achieving scheduling objectives than the mean absolute deviation (MAD) problem. We propose three heuristic solution methods based on several dominance conditions. Numerical examples are presented. This article extends the results to the problem to the problem of scheduling n-jobs on m-parallel identical processors in order to minimize the weighted mean absolute deviation.

• Management Science and Financial Engineering
• /
• v.13 no.1
• /
• pp.93-113
• /
• 2007

In the previous research, we considered a logistics brokerage problem with the objective of minimizing total transportation lead time of freights in a logistics e-marketplace, in which a logistics brokerage agent intermediates empty vehicles and freights registered by car owners and shippers [7]. However, in the logistics e-marketplace, transportation due date tardiness is more important than the transportation lead time, since transportation service level is critically determined by whether the due date is met or not. Therefore, in this paper, we deal with the logistics brokerage problem with the objective of minimizing total tardiness of freights. Hungarian method based matching algorithms, real time matching(RTM), periodic matching(PM), and fixed matching(FM), are used for solving the problem considered in this paper. In order to test performance of the proposed algorithms, we perform computational experiments on a various problem instances. The results show that the waiting-and-matching algorithms, PM and FM, also give better performance than real time matching strategy, RTM, for the total tardiness minimization problem as the algorithms did for the total lead time minimization problem.

• Journal of the Korea Society for Simulation
• /
• v.9 no.3
• /
• pp.13-26
• /
• 2000

The scheduling rule for the fabrication process of the semiconductor manufacturing is suggested and tested on the simulation system which was developed based on the model to represent the main characteristics of wafer flows. The proper scheduling policies are necessary to meet the order change in the supply chain management. It was shown that the suggested rules which consider the wafer balance and the due date of the order, give good performances for the cycle time reduction and the rate of meeting due date as well. Also they are robust in the sense that performances are stable regardless of the order change rate and the input policies.

• Proceedings of the Safety Management and Science Conference
• /
• 2006.11a
• /
• pp.193-200
• /
• 2006

In case of domestic automobile manufacturers introduce and run a order production method, JIT system is to provide a necessary number of components for a right place timely which is a specific supply chain management is different from other occupations. This study is for establishing a efficient production planning and finding a management method to correspond with a manufacturing system and diversified supply chain management and building an information system to support it. For this, analyze the relevant business process and utilize various informations occur in supply chain of domestic automobile components manufacturer. It will contribute to not only reliability improvement of production management system but also satisfaction for due date of products.