SIMULATED ANNEALING AND JOINT MANUFACTURING BATCH-SIZING

Abstract: We address an important problem of a manufacturing system. The system procures raw materials from outside suppliers in a lot and processes them to produce finished goods. It proposes an ordering policy for raw materials to meet the requirements of a production facility. In return, this facility has to deliver finished products demanded by external buyers at fixed time intervals. First, a general cost model is developed considering both raw materials and finished products. Then this model is used to develop a simulated annealing approach to determining an optimal ordering policy for procurement of raw materials and also for the manufacturing batch size to minimize the total cost for meeting customer demands in time. The solutions obtained were compared with those of traditional approaches. Numerical examples are presented. Keywords: Inventory, procurement, periodic delivery, optimum order quantity, heuristic, simulated annealing.

[1]  Yao Xin,et al.  Call routing by simulated annealing , 1995 .

[2]  Mauricio Solar,et al.  Solution for the constrained guillotine cutting problem by simulated annealing , 1998, Comput. Oper. Res..

[3]  Bhaba R. Sarker,et al.  A reply to ‘A note on “Economic manufacturing quantity in a just-in-time delivery system”’ , 1993 .

[4]  Xin Yao,et al.  A new simulated annealing algorithm , 1995, Int. J. Comput. Math..

[5]  B. Sarker,et al.  Economic manufacturing quantity in a just-in-time delivery system , 1992 .

[6]  Bhaba R. Sarker,et al.  An optimal batch size for a production system operating under a just-in-time delivery system , 1993 .

[7]  A. N. Mustafizul Karim,et al.  Two cases of integrated inventory system , 1993 .

[8]  Mauricio Solar,et al.  Solution for the constrained guillotine cutting problem by simulated annealing , 1998 .

[9]  David F. Pyke,et al.  Inventory management and production planning and scheduling , 1998 .

[10]  Tarunraj Singh,et al.  Machining condition optimization by genetic algorithms and simulated annealing , 1997, Comput. Oper. Res..

[11]  Gyana R. Parija,et al.  An Optimal Batch Size for a Production System Operating Under a Fixed-Quantity, Periodic Delivery Policy , 1994 .

[12]  B. Sarker,et al.  Optimal batch size and raw material ordering policy for a production system with a fixed-interval, lumpy demand delivery system , 1996 .

[13]  Yeong-Dae Kim,et al.  Simulated annealing and genetic algorithms for scheduling products with multi-level product structure , 1996, Comput. Oper. Res..

[14]  R. Kuik,et al.  Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic , 1990 .

[15]  Prafulla Joglekar,et al.  The Individually Responsible and Rational Decision Approach to Economic Lot Sizes for One Vendor and Many Purchasers , 1990 .

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[17]  Christos Koulamas,et al.  A survey of simulated annealing applications to operations research problems , 1994 .

[18]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[19]  A. N. Mustafizul Karim,et al.  An optimum batch size for a production system operating under a continuous supply/demand , 1995 .

[20]  S. K. Goyal,et al.  An Integrated Inventory Model for a Single Product System , 1977 .

[21]  Xin Yao,et al.  Simulated annealing with extended neighbourhood , 1991, Int. J. Comput. Math..

[22]  Marc Salomon,et al.  LINEAR PROGRAMMING, SIMULATED ANNEALING AND TABU SEARCH HEURISTICS FOR LOTSIZING IN BOTTLENECK ASSEMBLY SYSTEMS , 1993 .

[23]  G. K. Adil,et al.  Assignment allocation and simulated annealing algorithms for cell formation , 1997 .