Lot sizing heuristics performance

International Journal of Engineering Business Management

Volumn 5, Issue 1, 2013, Pages 1-10

  Baciarello, Luca ^a   D'Avino, Marco ^b   Onori, Riccardo ^c   Schiraldi, Massimiliano M ^a,b  

^a CENTRO RICERCHE FIAT   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c Business Process Management and Improvement Srl   (Italy)

Author keywords

Heuristics performances; Lot sizing; Unconstrained single item lot sizing problem

Indexed keywords

EID: 84875889424     PISSN: None     EISSN: 18479790     Source Type: Journal    
DOI: 10.5772/56004     Document Type: Article

References (61)

1. Harris FW (1913) How many parts to make at once. The Magazine of Management, 10: 135-136
2. Bregni A, D'Avino M, Schiraldi MM (Working Paper) A revised and improved version of the MRP algorithm: RevMRP
3. D'Avino M, De Simone V, Schiraldi MM (2013) Revised MRP for reducing inventory level and smoothing order releases: a case in manufacturing industry. Production Planning & Control (forthcoming)
4. Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Management Science, 5, 1: 89-96
5. Evans JR (1985) An efficient implementation of the Wagner-Whitin algorithm for dynamic lot-sizing. Journal of Operations Management, 5, 2: 229-235
6. Aggarwal A, Park JK (1986) Improved Algorithms for economic lot size problems. Operations Research, 34: 237-249
7. Federgruen A, Tzur M (1991) A simple forward algorithm to solve general dynamic lot-sizing models with n periods in O(nlogn) or O(n) time. Management Science, 37: 909-925
8. Wagelmans PM, Van Hoesel S, Kolen A (1992) Economic lot sizing: an O(n log n) that runs in linear time in the Wagner Whitin case. Operations Research, 40, 1: S145-S156
9. Van Hoesel A, Ruik R, Salomon M, Van Wassenhove LN (1994) The single item discrete lot-sizing and scheduling problem: Optimization by linear and dynamic programming. Discrete Mathematics, 48: 289-303
10. Ahuja RK, Hochbaum DS (2008) Solving linear cost dynamic lot sizing problems in O(n log n) time. Operations research, 56, 1: 255-261
11. Rogers J (1958) A computational approach to the economic lot scheduling problem. Management Science, 4: 264-291
12. Hanssmann F (1962) Operation Research in Production and Inventory Control. John Wiley, 1962
13. Bitran GR, Yanasse HH (1982) Computational complexity of the capacited lot size problem. Management Science, 28, 10: 1174-1186
14. Sandbothe RA, Thompson GL (1990) A forward algorithm for the capacited lot size model with stockouts. Operations Research, 38, 3: 474-486
15. Du Merle O, Goffin JL, Trouiller C, Vial JP (1999) A Lagrangian relaxation of the capacitated multi-item lot sizing problem solved with an interior point cutting plane algorithm. Approximation and Complexity in Numerical Optimization: Continuous and discrete problems, Kluwer Academic Publishers, 1999
16. Hsu WL (1983) On the general feasibility test of scheduling lot sizes for several products on one machine. Management Science, 29: 93-105
17. Yao MJ, Elmaghraby SE (1964) The economic lot scheduling problem under power-of-two policy. Computers and Mathematics with Applications, 41: 465-471
18. Elmaghraby SE (1978) The economic lot scheduling problem (ELSP): review and extensions. Management Science 24: 587-598
19. Lopez MA, Kingsmann BG (1991) The economic lot scheduling problem: theory and practice. International journal of Productions Economics 23: 147-164
20. Zangwill W (1969) A backlogging model and a multiechelon model of a dynamic economic lot size production system: a network approach. Management Science, 15: 506-527
21. Pochet Y, Wolsey LA (1998) Lot-size models with backlogging: Strong reformulation and cutting planes. Mathematical Programming, 40: 317-335
22. Sambasivam M, Schmidt CP (2000) A solution procedure to solve incapacitated lot sizing for multiplant, multi-period problems with inter-plant transfers. Technical report, University of Putra Malaysia, Faculty of Economics and Management, 2000
23. Ghare PM, Shrader GF (1963) A model for exponentially decaying inventories. Journal of Industrial Engineering, 14: 238-243
24. Hariga M (1996) Optimal EOQ models for deteriorating items with time-varying demand. Journal of Operation Research Society, 47: 1228-1246
25. Papachristos S, Skouri K (2000) An optimal replenishment policy for deteriorating items with time-varying and partial exponential type backlogging. Operations Research Letters, 27: 175-184
26. Friedman Y, Hoch Y (1978) A dynamic lot size model with inventory deterioration. INFOR, 16: 183-188
27. Nahmias S (1982) Perishable inventory theory: A review. Operations Research 30: 680-708
28. Rajagopalan S (1992) Deterministic capacity expansion under deterioration. Management Science, 38: 525-539
29. Covert RP, Philip GC (1973) An EOQ model for items with Weibull distribution deterioration. AIIE Transactions 5: 323-326
30. Hsu VN (2000) Dynamic economic lot size model with perishable inventory. Management Science, 46, 8: 1159-1169
31. Simpson VP (1978) Optimum solution structure for a repairable inventory problem. Operations Research, 26: 270-281
32. Richter K, Sombrutzki M (2000) Remanufacturing planning for the reverse Wagner/Whitin models. European Journal of Operational Research, 121: 304-315
33. Love SF (1973) Bounded production and inventory models with piecewise concave costs. Management Science, 20, 3: 313-318
34. Eppen GD, Martin RK (1987) Solving multi-item capacitated lot sizing problems using variable redefinitions. Operations Research, 35: 832-848
35. Lee Y, Cetinkaya S, Wagelmans APM (2001) A Dynamic Lot-Sizing Model with Demand Time Windows. Management Science, 47, 10: 1384-1395
36. Dauzere-Peres S, Brahimi N, Najid N, Nordli A (2002) The single item lot sizing problem with Time Windows. Technical Report, Ecole des Mines de Nantes, France, 2002
37. Bahl HC, Ritzman LP, Gupta JND (1987) Determining lot sizes and resources requirements: a review. Operations Research, 35, 3: 329-345
38. Brahimi N, Dauzere-Peres S, Najid NM, Nordli A (2006) Single item lot sizing problems. European Journal of Operations Research 168: 1-16
39. Haddock J, Hubicky DE (1989) Which lot sizing techniques are used in Materials Requirements Planning? Production and Inventory Management,30, 3: 53-56
40. Buschkühl L, Sahling F, Helber S, Tempelmeier H (2010) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectrum, 32, 2: 231-261
41. Winands EMM, Adan IJBF, van Houtum GJ (2011) The stochastic economic lot scheduling problem: A survey. European Journal of Operational Research, 210, 1: 1-9
42. Tiacci L, Saetta S (2012) Demand forecasting, lot sizing and scheduling on a rolling horizon basis. International Journal of Production Economics, 140, 2: 803-814
43. Van den Heuvel W, Wagelmans APM (2010) Worst- Case Analysis for a General Class of Online Lot- Sizing Heuristics. Operations Research, 58, 1: 59-67
44. Goren HC, Tunali S, Jans R (2010) A review of applications of genetic algorithms in lot sizing. Journal of Intelligent Manufacturing, 21, 4: 575-590
45. Han Y, Cai J, Kaku Y Li Y, Chen Y, Tang J (2012) Evolutionary algorithms for solving unconstrained multilevel lot-sizing problem with series structure. Journal of Shanghai Jiaotong University - Science, 17, 1: 39-44
46. Xiao Y, Kaku Y, Zhao Q, Zhang R (2012) Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems. Computers & Operations Research, 39, 3: 647-658
47. Nydick Jr RL, Weiss HJ (1989) An evaluation of variable-demand lot-sizing techniques. Production and Inventory Management, 30, 4: 41-48
48. Jeunet J, Jonard N (2000) Measuring the performance of lot-sizing techniques in uncertain environments. International Journal of Production Economics, 64: 197-208
49. Kropp DH, Carlson DC, Jucker JV (1983) Heuristic lot-sizing approach for dealing with MRP system nervousness. Decision Sciences, 14: 159-169
50. Simpson NC (2001) Questioning the relative virtues of dynamic lot sizing rules. Computers & Operations Research, 28: 899-914
51. Sridharan SV, Berry WL, Udayabhanu V (1988) Measuring master production schedule stability under rolling planning horizons. Decision Sciences, 19, 1: 147-166
52. Sridharan SV, LaForge RL (1990) An analysis of alternative policies to achieve schedule stability. Journal of Manufacturing and Operation Management, 3, 20: 53-73
53. Orlicky J (1974) Material Requirements Planning. McGraw Hill, New York, 1974
54. Silver EA, Meal HC (1973) A heuristic selecting lot size requirements for the case of a deterministic timevarying demand rate and discrete opportunities for replenishment. Production and Inventory Management, 14, 2: 64-74
55. DeMatteis JJ (1978) An economic lot sizing technique: the part period algorithm. IBM Systems Journal, 7, 1: 30-38
56. Narasimhan S, McLeavy DW, Billigton P (1995) Production Planning and Inventory Control, 2nd edition. Prentice Hall, 1995
57. Groff GK (1979) A lot sizing rule for time phased component demand. Production and Inventory Management, 20, 4: 66-74
58. Freeland JR, Colley JL (1982) A simple heuristic method for lot sizing in a time-phased reorder system. Production and Inventory Management, 23, 1: 15-21
59. McLaren BJ (1977) A Study of Multiple Level Lot Sizing Procedures for Material Requirements Planning Systems. PhD dissertation, Purdue University
60. Karni R (1981) Maximum part-period gain (MPG): a lot sizing procedure for unconstrained and constrained requirements planning systems. Production and Inventory Management, 22: 91-98
61. Axater S (1985) Performance bounds for lot sizing heuristics. Management Science, 31, 5: 634-640