Modele i algorytmy optymalizacji wielkości partii produkcyjnej

• Autorzy: Józefowska J. , Skotarczak-Dobrzyńska K.
• Konferencja: Oszczędność i efektywność - współczesne rozwiązania w logistyce i produkcji
• Języki publikacji: PL

Abstrakty

PL

Problem optymalizacji wielkości partii produkcyjnej jest jednym z podstawowych problemów optymalizacyjnych rozważanych w sterowaniu i planowaniu produkcji. Od wielu lat problem ten jest przedmiotem badań w wiodących ośrodkach naukowych na całym świecie. W związku z tym w literaturze pojawia się wiele modeli optymalizacyjnych. Artykuł ten ma na celu przedstawić podstawowe modele, dokonać ich systematyki oraz pokazać ich genezę. Złożoność modeli optymalizacji wielkości partii produkcyjnej sprawia, że opracowano wiele metod rozwiązujących te problemy w sposób przybliżony. Metody te zostały również sklasyfikowane i scharakteryzowane.

Słowa kluczowe

PL

optymalizacja wielkości partii produkcyjnej; algorytmy heurystyczne; programowanie matematyczne

• Wydawca: Sieć Badawcza Łukasiewicz - Poznański Instytut Technologiczny
• Czasopismo: Logistyka
• Rocznik: 2007
• Tom: nr 1
• Strony: CD--CD
• Opis fizyczny: -pełny tekst, Bibliogr. 38 poz., tab.

Twórcy

autor

Józefowska J.

autor

Skotarczak-Dobrzyńska K.

Bibliografia

• [1] Araujo S A & Arenales M N, Problema de Dimensionamento de Lotes Monoestágio com Restrição de Capacidade: Modelagem, Metodo de Resolução e Resultados Computacionais, Pesquisa Operacional, 20, 2000, s. 287-306.
• [2] Barbarosoglu G & Özdamar L, Analysis of solution space-dependent performance of simulated annealing: the case of the multi-level capacited lot sizing problem, Computers and Operations Research, 27, 2000, s. 895-903.
• [3] Belvaux G & Wolsey L A, Lot sizing problems: Modelling issues and specialized branch-and-cut system BC-PROD, Management Science, 46, 2000, s. 724-738.
• [4] Clark A R & Armentano V A, Echelon stock formulation for multi-stage lot-sizing with component lead times, Int. J. Systems Science, 24/9, 1993, s. 1759-1775.
• [5] Clark A R & Armentano V A, A heuristic for resource-capacited multi-stage lot-sizing problem with lead times, Journal of Operational Research Society, 46, 1995, s. 1208-1222.
• [6] Clark A R, Batch seqencing and sizing with regular varying demand, Production Planning & Control, 9/3, 1998 s. 260-266.
• [7] Clark A, A Local Search Approach to Lot Sequencing and Sizing, Proceeding of the 2000, FIP WG5.7, Florence, Italy.
• [8] Crauwels H A J, Potts C N & Van Wassenhove L N, Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs, European Journal of Operational Research, 90, 1996, s. 200-213.
• [9] Disney S M, Naim M N & Towill D R, Genetic algorithm optimisation of a class of inventory control systems, International Journal of Production Economics, 68, 2000, s. 259-278.
• [10] Drexl A & Haase K, Proportional lotsizing and scheduling, International Journal of production Economics , 40, 1995, s. 73-87.
• [11] Drexl A & Haase K, Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling, Journal of the Operational Research Society, 47, 1996, s. 251-265.
• [12] Drexl A & Kimms A, Lot sizing and scheduling – Survey and extensions, European Journal of Operational Research, 99, 1997, s. 221-235.
• [13] Fleischmann B, The Disceet Lot Sizing and Scheduling Problem with Sequence-Dependent Setup-Cost, European Journal of Operational Research, 75, 1994, s. 395-404.
• [14] Fleischmann B & Meyr H, The General Lotsizing and Scheduling Problem, OR Spektrum, 19/1, 1997, s. 11-21.
• [15] França P M; Armentano V A; Berretta R E & Clark A R, A Heuristic for Lot-Sizing in Multi-stage Systems, Computers and Operations Research, 24/ 9, 1997, s. 861-874.
• [16] Haase K, Capacitated lot-sizing with sequence dependent setup costs, OR Spektrum, 18, 1996, s. 51-59.
• [17] Haase K & Kimms A, Lot Sizing and Scheduling with Sequence-Dependent Setup Costs and Times and Efficient Rescheduling Opportunities, International Journal of Production Economics, 66, 2000, s. 159-169.
• [18] Hyun C J, Kim Y & Kim Y K, A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines, Computers and Operations Research, 25, 7/8, 1998, s. 675-690.
• [19] Ip W H, Li Y, Man K F & Tang K S, Multi-product planning and scheduling using genetic algorithm approach, Computers & Industrial Engineering, 38, 2000, s. 283-296.
• [20] Kang S, Malik K & Thomas L J, Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs, Management Science, 45/2, 1999.
• [21] Khouja M, Michalewicz Z & Wilmot M, The use of genetic alghoritms to solve the economic lot size scheduling problem, European Journal of Operational Research. 110, 1998, s. 509-524.
• [22] Kim J & Kim Y, Simulated Annealing and Genetic Algorithms for Scheduling Products with Multi-level Product Structure, Computers Operations Research, 23/9, 1996, s. 857-868.
• [23] Kimms A, A genetic algorithm for multi-level, multi-machine lot sizing and scheduling, Computers & Operations Research, 26, 1999, s. 829-848.
• [24] Kuik R, Salomon M, Multi-level lot-sizing problem: Evaluation of simulated-annealing heuristic, European Journal of Operational Research, 45, 1990, s. 35-37.
• [25] Kuik R, Salomon M, Van Wassenhove L N & Maes J, Linear programming, simulated annealing and tabu search heuristics for lotsizing in bottleneck assembly systems, IIE Transactions, 25/1, 1993, s. 62-72.
• [26] Laguna M, A heuristic for Production Scheduling and Inventory Control in the Presence of Sequence-dependent setup times, IIE Transactions, 31, 1999, s. 125-134.
• [27] Lee I, Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs, Computers and Operations Research, 28, 2001, s. 835-852.
• [28] Maes J & Wasenhove L V, Multi-Item Single-Level Capacited Dynamic Lot-Sizing Heuristics: A Computational Comparison (Part II: Rolling Horizon), IIE Transactions, 1986/7, s. 124-129.
• [29] Maes J & Wasenhove L V, Multi-Item Single-Level Capacited Dynamic Lot-Sizing Heuristics: A General review, Operational Research Society, 39/11, 1988, s. 991-1004.
• [30] Maes J, McClain J O & Van Wasenhove L N, Multilevel Lotsizing Complexity and LP-based heuristics, European Journal of Operational Research, 53, 1991, s. 131-148.
• [31] Meyr H, Simultanous Lotsizing and Scheduling by Combining Local Search with Dual Reoptimization, European Journal of Operational Research, 120, 2000, s. 311-326.
• [32] Meyr H, Simulaneous Lotsizing and Scheduling on Parallel Machines, 2001.
• [33] Rodrigues L F, Meta-heuristicas Evolutivas para Diminsionamento de Lotes com Restrições de Capacidade em Sistemas Multiestágios, Thesis presented in University of São Paulo, ICMC, Maj 2000.
• [34] Salomon M, Kuik R & Van Wassenhove L N, Statistical search methods for lotsizing problems, Annals of Operations Research, 41, 1993, s. 453-468.
• [35] Santos-Meza E dos, Santos M O dos, Arenales M N, A lot-sizing problem in an automated foundry, European Journal of Operational Research.
• [36] Sikora R, A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacited flow line, Computers Industrial Engineering, 30/4, 1996, s. 969-981
• [37] Staggemeier A T, Clark A R, A Survay of Lot-sizing and Scheduling Models, 23rd Annual Symposium of the Brazilian Operational Research Society (SOBRAPO), Campos do Jordão, Brazil, Listopad 2001.
• [38] Wolsey L A, MIP Modelling of Changeovers in Production Planning and Scheduling Problems, European Journal of Operational Research, 99, 1997, s. 154-161.