Summary
This chapter addresses integrated production and delivery scheduling of several items in a two-echelon supply chain. A single supplier produces the items on a flexible flow line (FFL) under a cyclic policy and delivers them directly to an assembly facility over a finite planning horizon. A new mixed zero-one nonlinear programming model is developed, based on the basic period (BP) policy to minimize average setup, inventory-holding and delivery costs per unit time where stock-out is prohibited. This problem has not yet been addressed in literature. It is computationally complex and has not been solved optimally especially in real-sized problems. Two efficient hybrid genetic algorithms (HGA) are proposed using the power-of-two (PT-HGA) and non-power-of-two (NPT-HGA) policies. The solution’s quality of the proposed algorithms is evaluated and compared with the common cycle approach in a number of randomly generated problem instances. Numerical experiments demonstrate the merit of the NPT-HGA and indicate that it constitutes a very promising solution method for the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bomberger, E.E.: A dynamic programming approach to the lot size scheduling problem. Management Science 12, 778–784 (1966)
Cheng, R., Gen, M.: Parallel machine scheduling problems using memetic algorithms. Computers and Industrial Engineering 33, 761–764 (1997)
Eilon, S.: Scheduling for batch production. Institute of Production Engineering Journal 36, 549–579 (1957)
Elmaghraby, S.E.: The economic lot scheduling problem: review and extensions. Management Science 24, 587–598 (1978)
El-najdawi, M., Kleindorfer, P.R.: Common cycle lot size scheduling for multi-product, multi-stage production. Management Science 39, 872–885 (1993)
El-najdawi, M.: Multi cyclic flow shop scheduling: An application for multi-product, multi-stage production processes. International Journal of Production Research 39, 81–98 (1997)
Fatemi Ghomi, S.M.T., Torabi, S.A.: Extension of common cycle lot size scheduling for multi-product, multi-stage arborscent flow-shop environment. Iranian Journal of Science and Technology, Transaction B 26, 55–68 (2002)
Hahm, J., Yano, C.A.: The economic lot and delivery-scheduling problem: The single item case. International Journal of Production Economics 28, 235–252 (1992)
Hahm, J., Yano, C.A.: The economic lot and delivery-scheduling problem: The common cycle case. IIE Transactions 27, 113–125 (1995)
Hahm, J., Yano, C.A.: The economic lot and delivery scheduling problem: Models for nested schedules. IIE Transactions 27, 126–139 (1995)
Holland, J.H.: Adaptation in Natural and Artificial Systems, 2nd edn. University of Michigan / MIT Press (1992)
Hsu, W.L.: On the general feasibility test of scheduling lot sizes for several products on one machine. Management Science 29, 93–105 (1983)
Jensen, M.T., Khouja, M.: An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem. European Journal of Operational Research 156, 305–311 (2004)
Khouja, M., Michalewicz, Z., Wilmot, M.: The use of genetic algorithm to solve the economic lot size scheduling problem. European Journal of Operational Research 110, 509–524 (1998)
Khouja, M.: The economic lot and delivery-scheduling problem: Common cycle, rework, and variable production rate. IIE Transactions 32, 715–725 (2000)
Ouenniche, J., Boctor, F.F.: Sequencing, lot sizing and scheduling of several components in job shops: The common cycle approach. International Journal of Production Research 36, 1125–1140 (1998)
Ouenniche, J., Boctor, F.F.: The multi-product, economic lot-sizing problem in flow shops: the powers-of-two heuristic. Computers and Operations Research 28, 1165–1182 (2001)
Ouenniche, J., Boctor, F.F.: The two-group heuristic to solve the multi-product, economic lot-sizing and scheduling problem in flow shops. European Journal of Operational Research 129, 539–554 (2001)
Ouenniche, J., Boctor, F.F.: The G-group heuristic to solve the multi-product, sequencing, lot-sizing and scheduling problem in flow shops. International Journal of Production Research 39, 89–98 (2001)
Ouenniche, J., Bertrand, J.W.M.: The finite horizon economic lot sizing problem in job shops: The multiple cycle approach. International Journal of Production Economics 74, 49–61 (2001)
Quadt, D., Kuhn, H.: Conceptual framework for lot-sizing and scheduling of flexible flow lines. International Journal of Production Research 43, 2291–2308 (2005)
Torabi, S.A., Karimi, B., Fatemi Ghomi, S.M.T.: The common cycle economic lot scheduling in flexible job shops: The finite horizon case. International Journal of Production Economics 97, 52–65 (2005)
Torabi, S.A., Fatemi Ghomi, S.M.T., Karimi, B.: A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains. European Journal of Operational Research 173, 173–189 (2006)
Yao, M.J., Elmaghraby, S.E.: On the economic lot scheduling problem under power-of-two policy. Computers and Mathematics with Applications 41, 1379–1393 (2001)
Yao, M.J., Huang, J.X.: Solving the economic lot scheduling problem with deteriorating items using genetic algorithms. Journal of Food Engineering 70, 309–322 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Torabi, S.A., Jenabi, M., Mansouri, S.A. (2008). Hybrid Genetic Algorithms for the Lot Production and Delivery Scheduling Problem in a Two-Echelon Supply Chain. In: Fink, A., Rothlauf, F. (eds) Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management. Studies in Computational Intelligence, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69390-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-69390-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69024-5
Online ISBN: 978-3-540-69390-1
eBook Packages: EngineeringEngineering (R0)