Solving the economic lot scheduling problem with deteriorating items using genetic algorithms

The focus of this study is to solve the Economic Lot Scheduling Problem (ELSP) with deteriorating items using the extended basic period approach under Power-of-Two (PoT) policy. The ELSP is concerned with the lot sizing and scheduling decision of n items, and, PoT policy requires the replenishment frequency of each item to be a PoT integer. Since the conventional ELSP is shown as an NP-hard problem, we propose a hybrid genetic algorithm (HGA) that is equipped with a feasibility testing procedure, namely, Proc FT, and a binary search heuristic to efficiently solve the ELSP with deteriorating items. We use Proc FT to test the feasibility of the local optimum for the set of replenishment frequencies obtained by the evolutionary process of genetic algorithm. When the local optimum for the set of replenishment frequencies is infeasible, we employ the proposed binary search heuristic to search for a feasible solution with the minimal objective value. We use six benchmark examples to evaluate the performance of the proposed hybrid GA. Our numerical results demonstrate that the proposed hybrid GA is an efficient approach in solving the ELSP with deteriorating items. Therefore, we conclude that the proposed HGA could be a favorable decision support tool for managers in the food industry to efficiently derive their production scheduling and lot-sizing strategies for deteriorating items.

[1]  Prakash L. Abad,et al.  Optimal lot size for a perishable good under conditions of finite production and partial backordering and lost sale , 2000 .

[2]  R. Vickson,et al.  Two heuristics for the economic lot scheduling problem: An experimental study , 1988 .

[3]  Salah E. Elmaghraby,et al.  ON THE FEASIBILITY TESTING OF THE ECONOMIC LOT SCHEDULING PROBLEM USING THE EXTENDED BASIC PERIOD APPROACH , 2003 .

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Ruhul A. Sarker,et al.  A genetic algorithm for solving economic lot size scheduling problem , 2002 .

[6]  Hui-Ming Wee,et al.  Production , Manufacturing and Logistics A single-vendor and multiple-buyers production – inventory policy for a deteriorating item , 2002 .

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[8]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[9]  P. Abad.  Optimal pricing and lot-sizing under conditions of perishability and partial backordering , 1996 .

[10]  Hark Hwang,et al.  A production inventory model for producing two-products at a single facility with deteriorating raw materials , 1991 .

[11]  Robin O. Roundy,et al.  Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems , 1989 .

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  W. Maxwell,et al.  The Joint Replenishment Problem with a Powers-of-Two Restriction , 1985 .

[14]  Hui-Ming Wee,et al.  BUYER-SELLER JOINT COST MODEL FOR DETERIORATING ITEMS WITH MULTIPLE LOT-SIZE DELIVERIES , 2001 .

[15]  Ming-Jong Yao,et al.  The peak load minimization problem in cyclic production , 2001, Comput. Oper. Res..

[16]  Po-Chung Yang,et al.  An integrated multi-lot-size production inventory model for deteriorating item , 2003, Comput. Oper. Res..

[17]  Salah E. Elmaghraby,et al.  The economic lot scheduling problem under power-of-two policy , 2001 .

[18]  Andrew Hunter,et al.  Crossing Over Genetic Algorithms: The Sugal Generalised GA , 1998, J. Heuristics.

[19]  Elsayed A. Elsayed,et al.  Analysis of inventory systems with deteriorating items , 1983 .

[20]  Zbigniew Michalewicz,et al.  The use of genetic algorithms to solve the economic lot size scheduling problem , 1998, Eur. J. Oper. Res..

[21]  Brian G. Kingsman,et al.  The economic lot scheduling problem: theory and practice , 1991 .

[22]  Edward A. Silver,et al.  Hybrid genetic algorithm for the economic lot-scheduling problem , 2002 .

[23]  Fayez F. Boctor.  The G-group heuristic for single machine lot scheduling , 1987 .

[24]  Barry L. Nelson,et al.  A framework for simulation-optimization software , 2003 .

[25]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[26]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[27]  H. Wee,et al.  Economic ordering policy of deteriorated item for vendor and buyer: An integrated approach , 2000 .

[28]  S. Fujita.  The Application of Marginal Analysis to the Economic Lot Scheduling Problem , 1978 .

[29]  Awi Federgruen,et al.  Optimal power-of-two replenishment strategies in capacitated general production/distribution networks , 1993 .

[30]  W. Hsu.  On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine , 1983 .

[32]  Fred Raafat,et al.  Survey of Literature on Continuously Deteriorating Inventory Models , 1991 .

[33]  Manoranjan Maiti,et al.  Inventory of multi-deteriorating items sold from two shops under single management with constraints on space and investment , 2001, Comput. Oper. Res..

[34]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[35]  Steven Nahmias,et al.  Perishable Inventory Theory: A Review , 1982, Oper. Res..

[36]  R. Misra,et al.  Optimum production lot size model for a system with deteriorating inventory , 1975 .

[37]  William L. Maxwell,et al.  Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems , 1985, Oper. Res..

[38]  S. Elmaghraby.  The Economic Lot Scheduling Problem (ELSP): Review and Extensions , 1978 .

[39]  Kheng Joo Heng,et al.  An order-level lot-size inventory model for deteriorating items with finite replenishment rate , 1991 .