A review of applications of genetic algorithms in lot sizing

Guner Goren, Hacer; Tunali, Semra; Jans, Raf
August 2010
Journal of Intelligent Manufacturing;Aug2010, Vol. 21 Issue 4, p575
Academic Journal
Lot sizing problems are production planning problems with the objective of determining the periods where production should take place and the quantities to be produced in order to satisfy demand while minimizing production, setup and inventory costs. Most lot sizing problems are combinatorial and hard to solve. In recent years, to deal with the complexity and find optimal or near-optimal results in reasonable computational time, a growing number of researchers have employed meta-heuristic approaches to lot sizing problems. One of the most popular meta-heuristics is genetic algorithms which have been applied to different optimization problems with good results. The focus of this paper is on the recent published literature employing genetic algorithms to solve lot sizing problems. The aim of the review is twofold. First it provides an overview of recent advances in the field in order to highlight the many ways GAs can be applied to various lot sizing models. Second, it presents ideas for future research by identifying gaps in the current literature. In reviewing the relevant literature the focus has been on the main features of the lot sizing problems and the specifications of genetic algorithms suggested in solving these problems.


Related Articles

  • LOT SIZING AND SEQUENCING FOR N PRODUCTS ON ONE FACILITY. Delporte, Christian M.; Thomas, L. Joseph // Management Science;Jun77, Vol. 23 Issue 10, p1070 

    The problem of determining both lot sizes and repeating sequences for N products on one facility is difficult due to the combinatorial and continuous nature of the problem. The work that has been done on the problem has made various assumptions ("zero-switch rule" or "equal lot size," for...

  • DÄ°NAMÄ°K PARTÄ° BÃœYÃœKLÜĞÜ PROBLEMÄ° İÇİN YAPAY SÄ°NÄ°R AÄžI MODELLERÄ°. Yakici Ayan, Tuba // Marmara University Journal of the Faculty of Economic & Administ;Jun2009, Vol. 26 Issue 1, p501 

    Artificial neural networks (ANN) have been used successfully to solve many problems in production planning process. In this paper, two neural network models - one of which is with reel coding and the other one is with binary coding - are developed to dynamic lot sizing. Back-propagation learning...

  • ECONOMIC LOT SCHEDULING PROBLEM WITH RAW MATERIAL CONSIDERATIONS. Gallego, Guillermo; Joneja, Dev // Operations Research;Jan/Feb94, Vol. 42 Issue 1, p92 

    We extend the traditional model of the economic lot scheduling problem by considering various issues associated with the management of the raw materials for production. Several items are produced on a single machine at finite production rates with setup times, and setup and inventory holding...

  • PRODUCTION OPTIMIZATION BY USING OF GENETIC ALGORITHMS AND SIMULATION MODEL. Schreiber, P.; Vazan, P.; Tanuska, P.; Moravcik, O. // DAAAM International Scientific Book;Jan2009, p169 

    The paper presents the way how it is possible to combine the behaviour of simulation model of production system and its optimization by genetic algorithms considering the fulfilment of quantitative production goals in defined conditions. The objective function expresses the production costs (it...

  • Algoritmo recocido simulado para el problema de la programación del tamaño del lote económico bajo el enfoque de ciclo básico. Hernández, José Omar; Hernández, Salvador; Flores, Idalia // INGENIARE - Revista Chilena de Ingeniería;Dec2011, Vol. 19 Issue 3, p473 

    The problem considered is that of scheduling the production of several different items over the same machine with restricted capacity and on a repetitive basis. The problem is NP-hard and there exist several methods for the problem. In this research we worked with Bomberger's basic cycle...

  • Optimal Batch Sizing and Repair Strategies for Operations with Repairable Jobs. So, Kut C.; Tang, Christopher S. // Management Science;May95, Vol. 41 Issue 5, p894 

    This paper presents a model of a bottleneck facility that performs two distinct types of operations: "regular" and "repair." Both switch-over time and cost are incurred when the facility switches from performing one type of operation to a different type. Upon the completion of a batch of jobs in...

  • THE ECONOMIC LOT SCHEDULING PROBLEM (ELSP): REVIEW AND EXTENSIONS. Elmaghraby, Salah E. // Management Science;Feb1978, Vol. 24 Issue 6, p587 

    The ELSP is a time-honored problem that "has been around" since 1915. It is the problem of accommodating cyclical production patterns when several products are made on a single facility. Recent contributions to its resolution resulted in either analytical approaches to a restricted problem, or...

  • ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling. Lambrecht, Marc R.; Ivens, Philip L.; Vandaele, Nico J. // Management Science;Nov98 Part 1 of 2, Vol. 44 Issue 11, p1548 

    We propose a general hierarchical procedure to address real-life job shop scheduling problems. The shop typically produces a variety of products, each with its own arrival stream, its own route through the shop and a given customer due date. The procedure first determines the manufacturing lot...


    This paper presents a model which treats the manufacturing cycle time as a function of the lot size in a multi-stage production system. Using this functional relationship to determine the magnitude of the work-in-process inventory, a model is developed to calculate the economic production...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics