• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.369-378
• /
• 1993

현대의 극심한 경쟁체제속에서 제조업체의 생존여부는, 얼마나 좋은제품을 신속히 시장에 출시하느냐에 달려있으며, 이러한 경쟁력을 갖추기 위해서는 제품개발에 관련된 각종정보의 부문간 공유 및 흐름의 제어가 그 성패의 관건이라 할 수 있다. 따라서 본 연구의 목적은 삼성전자의 제품개발과정에서 발생되는 모든 기술정보를 효율적으로 관리할 수 있는 체계를 확립하고, 이 체계를 System적으로 구현하여 각종 기술정보를 생성하고, 조회하는 개발자들의 현업에 이 System을 적용하고자 하는데 있다. 본 연구에 사용된 개발 Tool은 X-terminal과 HP EWS이었고, 실제 사용자들의 운용기종은 선진각국의 Server & Client추세에 따라, DB Server로는 HP9000/865S를 채택하고, Client로는 HP EWS, X-terminal, PC386등의 기종을 적용하였다. 또한 개발언어는 'C'language를 사용하였고 DBMS는 IBM MIS와의 연계를 위해, Oracle을 이용하였다. 본 연구의 결과로써 나타나는 효과는, 외형적으로 각종 기술정보의 공유로 인한 설계품질향상과 개발 납기 단축이라 할 수 있으며, 그 내면에 있는 개발관련 각종자료 및 업무의 표준화와 도면관리System의 개발 기술확보 또한 중요한 성과라 할 수 있다.

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

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.1-11
• /
• 1986

This research is concerned with n jobs, m parallel identical machines scheduling problem in which all jobs have a common due date. The objective of the research is to develop an optimum scheduling algorithm for determining an optimal job sequence, the optimal value of the common due date and the minimum makespan to minimize total cost. The total cost is based on the common due date cost, the earliness cost, the tardiness cost and the flow time cost of each job in the selected sequence. The optimum scheduling algorithm is developed. A numerical example is given to illustrate the scheduling algorithm.

• IE interfaces
• /
• v.13 no.3
• /
• pp.405-415
• /
• 2000

The accurate quotation of Available-To-Promise (ATP) plays a very important role in enhancing customer satisfaction and fill rate maximization. However, the complexity of Supply Chain structure, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. This paper presents a computerized ATP quotation system in global SCM environments where the worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We modeled the ATP quotation processes with the definition of required data flow and a comprehensive ATP-algorithm was newly developed. The illustrative example shows the efficiency of the proposed system is largely affected by the selection of alternative rules used in ATP-algorithm.

• Korea Multimedia Society
• /
• v.10 no.1
• /
• pp.139-148
• /
• 2006

현재 기업은 다양한 고객 요구사항을 충족시켜가면서 급속하게 발전하는 기술을 습득하고 발전과 경쟁력 확보를 위해, 협력 업체들과 연계관계를 유지하는 네트워크 형태의 공급사슬을 형성하고 있다. 공급사슬이 성공적으로 유지되기 위해서는 효율적인 정보교환이 필요한데, 기존의 EDI 시스템으로는 구축의 비용과 복잡성, 향후 발전방향에 불확실성 등의 문제점이 있기 때문에 SCM의 통합솔루션을 구축하기 위해서는 새로운 데이터 포맷이 필요하게 되었다. 본 논문에서는 이러한 문제점을 해결하기 위해 XML로 새로운 데이터 교환의 포맷을 정의하고, SCM 환경의 데이터 인터페이스 부분을 XML의 데이터베이스 스키마 정보를 이용하는 방법을 제시한다. 본 논문에서는 수주를 받고 다른 협력업체로 발주하는 시나리오는 다음과 같이 구성한다. 먼저 Web환경의 클라이언트에서 XML DOM객체를 이용하여 ADODB 서버로부터 XML 수주정보 파일을 생성하고, ERP 서버에서는 수주정보의 XML 파일을 ERP 서버에 저장한다. 저장된 수주정보를 이용하여 납기확약을 위한 생산계획과 구매계획을 세우고, 구매계획이 세워지면 다른 협력업체의 Web 서버로 발주정보를 보낸다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.3
• /
• pp.252-256
• /
• 2003

This paper deals with a case study on the development of computerized scheduling system for core products. We propose a heuristic algorithm which is based on the sequencing rules and the allocation rules to satisfy the due date for each product, and develop a scheduling system for the manufacturer of core products. The system operates under a client/server circumstance. The important information constitutes a database, and it can be retrieved whenever it is needed. The benefits of the scheduling system are the exclusion of hand operations of data, the reduction of execution time for production planning and the reduction of average inventories.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.125-134
• /
• 2000

Keeping the promised delivery date for a customer order is crucial for a company to promote customer satisfaction and generate further businesses. For this, a company should be able to quote the delivery date that can be achieved with the capacity available on the shop floor. In a dynamic make-to-order manufacturing environment, the problem of determining a delivery date for an incoming order with consideration of resource capacity, workload, and finished-product inventory can hardly be solved by an analytical solution procedure. This paper considers a situation in which a delivery date for a customer order is determined based on a job schedule, and presents the SimTriD algorithm that provides the best scheduling for determining a delivery date of customer order through the job schedule that efficiently utilizes manufacturing resources with consideration of interacting factors such as resource utilization, finished-product inventory, and due date.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.87-101
• /
• 2008

This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.7-11
• /
• 2007

This paper considers a shipment planning of products from manufacturers to a third-party warehouse for demands with production time windows where a demand must be replenished in its time window. The underling lot-sizing model also assumes cargo delivery cost in each inbound replenishment to the warehouse. For this model, an optimal O($nT^4$) is presented where n is the number of demands and T is the length of the planning horizon.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.1
• /
• pp.37-50
• /
• 1998

This paper considers the nonidentical parallel machine scheduling problem in which n jobs having different due dates are to be scheduled on m nonidentical parallel machines. For the make-to-order manufacturing environment, the objective is to minimize the number of tardy jobs. A 0-1 nonlinear programming model is formulated and a heuristic algorithm that allocates and sequences jobs to machines is developed. The proposed algorithm makes use of the concept of assignment problem based on the suitability measure as the cost coefficient. Computational experiments show that the proposed algorithm is superior to the existing one in some performance measures such as number of tardy jobs. In addition, this algorithm is appropriate for solving real industrial problems efficiently.