가동준비비용 및 시간이 작업순서에 종속하는 생산일정계획의 연속시간 모형 = Continuous-time Lot-sizing and Scheduling with Sequence-Dependent Setup Costs and Setup Times

국문 초록 (Abstract)

본 연구는 가동준비가 작업순서에 종속하는 단일기계에서의 로트결정 및 일정계획 문제의 새로운 연속시간 모형을 제시한다. 유한한 계획시평동안 확정적인 동적 수요를 갖는 다수 제품의 생산량 및 생산시기를 결정하는 문제로서 가동준비비용과 재고비용의 합을 최소화하는 목적을 갖는다. 생산능력은 제한적이며 추후납품은 허용되지 않는다. 본 모형의 특징은 첫째, 연속시간의 모형으로서 가동준비 및 생산이 다음 기간으로 단절 없이 연속될 수 있다는 점, 둘째, 가동준비비용 및 가동준비시간이 작업순서에 종속한다는 점, 셋째, 가동준비상태가 다음 기간으로 이전되며 유휴 기간동안 가동준비상태가 보존된다는 점을 들 수 있다. 생산일정을 짧게 나누는 생산연쇄 분할기법으로 모형화 하였으며, 열생성 프로세스 기반의 휴리스틱을 사용하여 실험 연산한 결과를 제시한다.

다국어 초록 (Multilingual Abstract)

We propose a new model for the continuous-time capacitated lot-sizing and scheduling problem with sequence-dependent setup times and setup costs that addresses the problem of simultaneously determining production quantities and timings of several products on a single, capacitated machine such that the sum of inventory holding costs and setup costs is minimized and known deterministic, dynamic demands in a finite number of planning periods are satisfied without delays. Setups and production lots are allowed to span two consecutive periods and setup states are preserved over idle periods. The solution technique designed is based on a column generation process coupled with the sequence-splitting in which the entire schedule is broken up into sub-sequences. This scheme is embedded into an optimizationbased heuristic and tested on a set of benchmark problem instances.

목차 (Table of Contents)

• 요 약
• 1. 도 입
• 2. 분할연쇄 모형
• 3. 네트워크 모형
• 4. 실험계산
• 5. 맺 음 말
• 부록: 열생성 프로세스의 하위문제
• 참고문헌
• Abstract
• 저자소개

참고문헌 (Reference)

1 "The General Lotsizing and Scheduling Problem" 9 : 11-21, 1997

2 "The Discrete Lot-Sizing and Scheduling Problem with Sequence-Dependent Setup Costs European Journal of Operational Research" 395-404, 1994

3 "The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups" 736-749, 1992

4 "The Capacitated Lot-sizing and Scheduling Problem with Sequence-dependent Setup Costs and Setup Times" 32 : 727-747, 2005

5 "The Capacitated Lot-Sizing Problem with Linked Lot Sizes" 49 : 1039-1054, 2003

6 "Some Extensions of the Discrete Lotsizing and Scheduling Problem" 801-812, 1991

7 "Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows" 494-513, 1997

8 "Simultaneous Lotsizing and Scheduling on Parallel Manines" 139 : 277-292, 2002

9 "Simultaneous Lotsizing and Scheduling by Combining Local Search with Dual Reoptimization" 311-326, 2000

10 "Set Partitioning and Column Generation Heuristics for Capacitated Dynamic Lotsizing European Journal of Operations Research" 38-47, 1990

11 "Progress in Linear Programming-Based Algorithms for Integer Programming : An Exposition" 12 : 2-23, 2000

12 "Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs" 993-1007, 2001

13 "Lotsizing in Capacitated Production Planning and Control Systems" 5-18, 1995

14 "Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs" 45 : 273-289, 1999

15 "Lotsizing and Scheduling for Production Planning Lecture Notes in Ec" Springer-Verlag 1994

16 "Lot Sizing and Scheduling with Sequence Dependent Setup Costs and Times and Efficient Rescheduling Opportunities Christian-Albrechts-Universitt zu Kiel"

17 "Lagrangean Relaxation for the Multi-item Capacitated Lot-sizing Problema Heuristic Implementation" 17 : 308-313, 1985

18 "European Journal of Operational Research" 337-348, 1990

19 "Economic Lot Scheduling Problem with Raw Material Considerations" 92-101, 1994

20 "Capacitated Lotsizing with Sequence Dependent Setup Costs" 51-59, 1996

21 "Capacitated Lot Sizing with Setup Times" 353-366, 1989

22 "A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover" 47 : 851-863, 2001

23 "A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times" 477-486, 1993