제품조달시간 제약을 가지는 주문에 대한 생산 및 배송 일정계획 = Production and Delivery Scheduling for Orders with Product Available Time Constraint

국문 초록 (Abstract)

본 연구에서는 주문생산방식(make-to-order)에서 고객들로부터 접수된 주문(order)들을 모두 처리하는데 소요되는 최종 완료시간을 최소화할 수 있는 주문간 생산 및 배송 순서를 결정하기 위한 주문일정계획모델(order scheduling model)을 고려하고 있다. 각 주문은 자체생산품과 외부조달품으로 구성되고, 자체생산품에 대해서는 독자적인 생산일정계획이 필요하지만, 외부조달품의 경우에는 외부에서 조달되며, 정해진 조달완료시점에 도착한다. 또한, 각 주문에 속한 제품들이 모두 준비된 이후에는 고객으로의 배송이 이루어지게 된다. 본 연구에서는 이러한 운영상의 구조를 생산 및 조달단계와 그 이후의 배송단계로 연결되는 2단계 모델로 구성하고 배송단계에서의 배송시간과 배송차량의 가용성에 따라 3가지 변형모델로 구분하여 각 모델에 대한 경영과학적 해법을 제공하고자 한다. 각 모델에서 해에 대한 우월성질들을 개발하고 최종 완료시간을 최소화 할 수 있는 최적 일정계획법을 제안한다. 특히, 마지막 모델에 대해서는 근사해를 제공하는 3가지 발견적 해법(heuristic)을 제안하고, 각 해법의 성능을 여러 가지 수치데이터에 대한 실험을 통해 검증하였다.

다국어 초록 (Multilingual Abstract)

This paper considers a coordinated production and delivery scheduling problem to minimize the maximum completion time of a finite number of orders received from customers. Each order consists of two types of products. One type is manufactured by an in-house facility, but the other type is outsourced from the outside facility(or, subcontractor) so that the available time of the outsourced product is given as positive lead time. After all the products belonging to each order are prepared, the order is delivered to customer. The completion time of each order is measured by the time when delivery of the order is completed. The objective of this paper is to find out optimal production and delivery schedule minimizing the maximum completion time of all orders. We suggest three different models according that whether the delivery times to each customer are different or not, and that whether the capacity of delivery vehicle is finite or not. In the problem analysis, we first characterize some solution properties and then derive simple methods to find out the optimal schedules for the model 1 and 2. For the last model 3, a branch and bound solution is suggested and efficient heuristic algorithms to find approximate solutions are also developed. The performances of the proposed heuristics are evaluated through numerical experiments.

목차 (Table of Contents)

• 〈요약〉
• Ⅰ. 서론
• Ⅱ. 제품조달과 배송을 고려한 주문일정계획문제의 정의
• Ⅲ. 분석과 해법
• Ⅳ. 모델 3을 위한 분석과 해법
• Ⅴ. 결론 및 추후연구
• 참고문헌
• 〈Abstract〉

참고문헌 (Reference)

1 이익선, "제품조달시간을 고려한 주문처리 일정계획에 관한 연구" 한국생산관리학회 17 (17): 3-26, 2006

2 Potts, C. N, "The Two-Stage Assembly Scheduling Problem:Complexity and Approximation" 43 (43): 346-355, 1995

3 Yang,J, "Scheduling with Batch Objectives" The Ohio State University 1998

4 Yang,J., "Scheduling Parallel Machines for the Customer Order Problem" 8 : 49-74, 2005

5 Leung,J.Y.T, "Scheduling Orders for Multiple Product Types with Due Date Related Objectives" 168 : 370-389, 2006

6 Sun,X, "Powerful Heuristics to Minimize Makespan in Fixed,3-Machine,Assembly-type Flowshop Scheduling" 146 : 499-517, 2003

7 Leung,J.Y.T, "Order Scheduling in an Environment with Dedicated Resources in Parallel" 8 : 355-386, 2005

8 Leung,J.Y.T, "Order Scheduling Models: an Overview, In: Kendall G., Burke E., Petrovic S., Gendreau M., editors, Multidisciplinary Scheduling"

9 Johnson,S.M, "Optimal Two-and Three-stage Production Schedules with Setup Times Included" 1 : 61-68, 1954

10 Lee,C.Y, "Minimizing the Makespan in the 3-Machine Assembly-type Flowshop Scheduling Problem" 39 (39): 616-625, 1993

11 Sung,C.S, "Minimizing Total Weighted Completion Time at a Pre-assembly Stage composed of Two Feeding Machines" 54 : 247-255, 1998

12 Yoon,S.H, "Fixed Pre-assembly Scheduling on Multiple Fabrication Machines" 96 : 109-118, 2005

13 Wang,Guoqing, "Customer Order Scheduling to Minimize Total Weighted Completion Time" to appear in Omega 2006

14 Ahmadi,R, "Coordinated Scheduling of Customer Orders for Quick Response" 52 : 493-512, 2005

15 Leung,J.Y.T, "Approximation Algorithms for Minimizing Total Weighted Completion Time of Orders on Identical Machines in Parallel" 53 : 243-260, 2006

16 Ignall,E., "Application of the Branch and Bound Technique to some Flow-shop Scheduling Problem" 13 : 400-412, 1965

17 Peterkofsky,R.L., "A Branch and Bound Solution for the Crane Scheduling Problem" 1 (1): 159-172, 1990