Abstract
Economic lot-scheduling problem (ELSP) has been studied since the 1950’s. ELSP deals with the scheduling of the production of several products on a single machine in a cyclical pattern. The machine can only produce one single product at a time, and there is a set-up cost and set-up time associated with each product. Researchers generally adopted two types of rounding off methods for the production frequency of products, namely, the nearest integer and power–of–two approaches. Production frequency of products defines the number of times that such product being produced during the cycle. Therefore, different production frequency actually leads to different optimization results. For this reason, this paper proposes a modified hybrid genetic algorithm to deal with this problem. Numerical examples are used to test the performance of the new approach. Results demonstrate the significance of the production frequency to the optimization results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bomberger, E.E.: A dynamic programming approach to a lot size scheduling problem. Management Science 12(11), 778–784 (1966)
Chatfield, D.C.: The economic lot scheduling problem: A pure genetic search approach. Computers and Operations Research 34(10), 2865–2881 (2007)
Dobson, G.: The economic lot-scheduling problem: Achieving feasibility using time-varying lot sizes. Operations Research Society of America 35(5), 764–770 (1987)
Gallego, G., Moon, I.: The effect of externalizing setups in the economic lot scheduling problem. Operations Research 40(3), 1035–1046 (1992)
Hsu, W.-L.: On the general feasibility test of scheduling lot sizes for several products on one machine. Management Science 29(1), 93–105 (1983)
Khouga, M., Michalewicz, Z., Wilmot, M.: The use of genetic algorithms to solve the economic lot size scheduling problem. European Journal of Operational Research 110(3), 509–524 (1998)
Manne, A.S.: Programming of economics lot sizes. Management Science 4(2), 115–135 (1958)
Moon, I., Silver, E.A., Choi, S.: Hybrid genetic algorithm for the economic lot-scheduling problem. International Journal of Production Research 40(4), 809–824 (2002)
Rogers, J.A.: A computational approach to the lot scheduling problem. Management Science 3(3), 264–284 (1958)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, H.K., Chung, S.H. (2010). Genetic Approach to Solve Economic Lot-Scheduling Problem. In: Huang, G.Q., Mak, K.L., Maropoulos, P.G. (eds) Proceedings of the 6th CIRP-Sponsored International Conference on Digital Enterprise Technology. Advances in Intelligent and Soft Computing, vol 66. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10430-5_69
Download citation
DOI: https://doi.org/10.1007/978-3-642-10430-5_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10429-9
Online ISBN: 978-3-642-10430-5
eBook Packages: EngineeringEngineering (R0)