A novel decomposition approach for on-line lot-sizing. (English) Zbl 1068.91511
Summary: A novel decomposition approach is presented for a class of on-line problems of Wagner-Whitin economic lot-sizing type. The decomposition is based on the fact that optimal plans contain regeneration points and that the plan between two regeneration points is independent of the rest of the plan. This property is exploited in the following way: first, estimate the next regeneration point and secondly, determine an optimal plan up to that point. The estimation of a next regeneration point can be done with an artificial neural network or with a statistical classification method. We present extensive experimental comparisons of the novel approach with more classical ones. The main conclusion from the results is that our approach dominates all other approaches with respect to robustness, performance, and data efficiency. Only in those cases where the demand is known for a large number of periods in advance some classical approaches perform better.
References:
| [1] | Aggarwal, A.; Park, J. K., Improved algorithms for economic lot size problems, Operations Research, 41, 549-571 (1993) · Zbl 0820.90035 |
| [2] | Bahl, H. C.; Ritzman, L. P.; Gupta, J. N.D., Determining lot sizes and resource requirements: A review, Operations Research, 35, 329-345 (1987) |
| [3] | Baker, K. R., An experimental study of the effectiveness of rolling schedules, Decision Sciences, 8, 19-27 (1977) |
| [4] | Bishop, C. M., Neural Networks for Pattern Recognition (1995), Clarendon Press: Clarendon Press Oxford |
| [5] | Blackburn, J. D.; Millen, R. A., Heuristic lot-sizing performance in a rolling-schedule environment, Decision Sciences, 11, 691-701 (1980) |
| [6] | Carlson, R. C.; Beckman, S. L.; Kropp, D. H., The effectvieness of extending the horizon in rolling production scheduling, Decision Sciences, 13, 129-146 (1982) |
| [7] | Federgruen, A.; Tzur, M., Minimal forecase horizon and a new planning procedure for the general lot sizing model: Nervousness revisited, Operations Research, 42, 456-468 (1994) · Zbl 0810.90031 |
| [8] | Gorham, T., Dynamic order quantities, Production and Inventory Management, 9, 75-81 (1968) |
| [9] | Harris, F. W., How many parts to make at once, Factory: The Magazine of Management, 10, 135-136 (1913) |
| [10] | Hassoun, M. H., Fundamentals of Artificial Neural Networks (1995), MIT Press: MIT Press Cambridge, MA · Zbl 0850.68271 |
| [11] | Hax, A. C.; Candea, D., Production and Inventory Management (1984), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ |
| [12] | Jagannathan, R.; Rao, M. R., A class of deterministic production planning problems, Management Science, 19, 1295-1300 (1973) |
| [13] | Karr, R. M., On-line algorithms versus off-line algorithsm: How much is it worth to know the future?, (van Leeuwen, J., Algorithms, Software, Architecture (1992), Elsevier: Elsevier Amsterdam), 416-429 |
| [14] | Lundin, R.A., 1973. Planning Horizon Procedures for Production-Inventory Systems with Concave Costs. Ph.D. Thesis, University of Chicago; Lundin, R.A., 1973. Planning Horizon Procedures for Production-Inventory Systems with Concave Costs. Ph.D. Thesis, University of Chicago |
| [15] | Lundin, R. A.; Morton, T. E., Planning horizons for the dynamic lot size model: Zabel vs protective procedures and computational results, Operations Research, 23, 711-734 (1975) · Zbl 0317.90028 |
| [16] | Morton, T. E., Forward algorithms for forward-thinking managers, (Schultz, R. L., Applications of Management Science, A Research Annual (1981), JAI Press: JAI Press London), 1-55 |
| [17] | Reed, R., Pruning algorithms - A survey, IEEE Transactions on Neural Networks, 4, 740-747 (1993) |
| [18] | Silver, E. A.; Meal, J. C., A heuristic for selecting lot size quantities for the case of deterministic time-varying demand rate and discrete opportunities for replenishment, Production and Inventory Management, 14, 64-74 (1973) |
| [19] | Silver, E. A.; Pyke, D. F.; Peterson, R., Inventory Management and Production Planning and Scheduling (1998), Wiley: Wiley Chichester |
| [20] | Stehouwer, H.P., 1997. On-line Lot-sizing with Perceptrons. Ph.D. Thesis, Eindhoven University of Technology; Stehouwer, H.P., 1997. On-line Lot-sizing with Perceptrons. Ph.D. Thesis, Eindhoven University of Technology · Zbl 0947.90517 |
| [21] | Wagner, H. M.; Whitin, T., Dynamic version of the economic lot-size model, Management Science, 5, 89-96 (1958) · Zbl 0977.90500 |
| [22] | Zwietering, P. J.; van Kraaij, M. J.A. L.; Aarts, E. H.L.; Wessels, J., Neural networks and production planning, (Proceedings of the Fourth International Conference on Neural Networks and their Applications (1991), Nı̂mes: Nı̂mes France), 529-542 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
