GRASP 기법을 이용한 주문이월과 자원제약을 고려한 공급사슬 망에서의 생산계획 알고리즘
A Production Planning Algorithm for a Supply Chain Network Considering Back-Order and Resource Capacity Using GRASP Method
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In an environment of global competition, the success of a manufacturing corporation is directly related to how it plans and executes production in particular as well as to the optimization level of its process in general. This paper proposes a production planning algorithm for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network considering back-order. MLCLSP corresponds to a mixed integer programming (MIP) problem and is NP-hard. Therefore, this paper proposes an effective algorithm, GRHS (GRASP-based Rolling Horizon Search) that solves this problem within reasonable computational time and evaluates its performance under a variety of problem scenarios.
Abstract
In an environment of global competition, the success of a manufacturing corporation is directly related to how it plans and executes production in particular as well as to the optimization level of its process in general. This paper proposes a production planning algorithm for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network considering back-order. MLCLSP corresponds to a mixed integer programming (MIP) problem and is NP-hard. Therefore, this paper proposes an effective algorithm, GRHS (GRASP-based Rolling Horizon Search) that solves this problem within reasonable computational time and evaluates its performance under a variety of problem scenarios.
참고문헌 (30)
- Aiex, R. M., "Probability distribution of solution time in GRASP: An experimental investigation", Journal of Heuristics, 8, pp.343~373 (2002)
- Almeder, C., "A hybrid optimization approach for multilevel capacitated lot-sizing problems", European Journal of Operational Research (2009)
- Akartunali, K., "A heuristic approach for big bucket multi-level production planning problems", European Journal of Operational Research, 193, pp.394~411 (2009)
- Bahl, H. C., "An Integrated Model for Master Scheduling, Lot Sizing and Capacity Requirements Planning", Journal of the Operational Research Society, 35, pp.389~399 (1984)
- Bahl, H. C., "Determining Lot Sizes and Resource Requirement: a Review", Operations Research, 35, pp.329~345 (1987)
- Drexl, A., "Proportional lot sizing and scheduling", International Journal of Production Economics, 40, pp.73~87 (1995)
- Eppen, G. D., "Solving multi-item capacitated lot-sizing problems using variable redefinition", Operations Research, 35, pp.832~848 (1987)
- Ertogral, K., "Auction-theoretic coordination of production planning in the supply chain", IIE Transactions, 32, pp.931~940 (2000)
- Feo, T. A., "Greedy randomized adaptive search procedures", Journal of Global Optimization, 6, pp.109~133 (1995)
- Fleischmann, B., "The discrete lot-sizing and scheduling problem", European Journal of Operational Research, 44, pp.337~348 (1990)
- Florian, M., "Deterministic Production Planning Algorithms and Complexity", Management Science, 26, pp.669~679 (1980)
- Hung, Y. F., "A Multi-Class Multi-Level Capacitated Lot Sizing Model", Journal of the Operational Research Society, 51(11), pp.1309~1318 (2000)
- Hung, Y. F., "Solving Mixed Integer Programming Production Planning Problems with Setups by Shadow Price Information", Computers and Operations Research, 25, pp.1027~1042 (1998)
- Jayaraman, V., "A Simulated Annealing Methodology to Distribution Network Design and Management", European Journal of Operational Research, 144, pp.629~645 (2003)
- Karmarkar, U., "The deterministic dynamic product cycling problem", Operations Research, 33, pp.326~345 (1985)
- Kimms, A., "Competitive Methods for Multi-level Lot Sizing and Scheduling：Tabu search and Randomized Regrets", International Journal of Production Research, 34(8), pp.2279~2298 (1996)
- Kimms, A., "A genetic algorithm for multi-level, multimachine lot sizing and scheduling", Computers and Operations Research, 26(8), pp.829~848 (1999)
- Kuik, R., "Batching Decisions : Structure and Models", European Journal of Operational Research, 75, pp.243~260 (1994)
- Kuik, R., "Linear Programming, Simulated Annealing and Tabu Search Heuristics for Lotsizing in Bottleneck Assembly Systems", IIE Transactions, 25(1), pp.62~72 (1993)
- Meas, J., "Mutilevel Capacitated Lotsizing Complexity and LP-based Heuristics", European Journal of Operational Research, 53, pp.131~148 (1991), 1991
- Rojanasoonthon, S., "A GRASP for parallel machine scheduling with time windows", INFORMS Journal on Computing, 13(1), pp.32~51 (2005)
- Ross, A. D., "A Two-Phsed Approach to the Supply Network Reconfiguration Problem", European Journal of Operational Research, 122, pp.18~30 (2000)
- Roundy, R. O., "Efficient, Effective Lot Sizing for Multi stage Production Systems", Operations Research, 41, pp.371~385 (1993)
- Sahling, F., "Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and -optimize heuristic", Computers and Operations Research, 36, pp.2546~2553 (2009)
- Stadtler, H., "Mixed Integer Programming Model Formulations for Dynamic Multi-Item, Multi-Level Capacitated Lotsizing", European Journal of Operational Research, 94, pp.561~581 (1996)
- Stadtler, H., "Improved rolling scheduling for the dynamic single-level lot-sizing problem", Management Science, 46(2), pp.318~326 (2000)
- Tempelmeier, H, "A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times", Management Science, 425, pp.738~757 (1996)
- Tempelmeier, H., "A Heuristic for Dynamic Multi-Item Multi-Level Capacitated Lotsizing for General Product Structures", European Journal of Operational Research, 75, pp.296~311 (1994)
- Trigeiro, W. W., "Capacitated lot-sizing with setup times", Management Science, 35, pp.353~366 (1989)
- Vergana, F. E., "An Evolutionary Algorithm for Optimizing Material Flow in Supply Chain", Computers and Industrial Engineering, 43, pp.407~421 (2002)