×

Real-time prediction of order flowtimes using support vector regression. (English) Zbl 1159.90356

Summary: In a make-to-order production system, a due date must be assigned to new orders that arrive dynamically, which requires predicting the order flowtime in real-time. This study develops a support vector regression model for real-time flowtime prediction in multi-resource, multi-product systems. Several combinations of kernel and loss functions are examined, and results indicate that the linear kernel and the \(\varepsilon \)-insensitive loss function yield the best generalization performance. The prediction error of the support vector regression model for three different multi-resource systems of varying complexity is compared to that of classic time series models (exponential smoothing and moving average) and to a feedforward artificial neural network. Results show that the support vector regression model has lower flowtime prediction error and is more robust. More accurately predicting flowtime using support vector regression will improve due-date performance and reduce expenses in make-to-order production environments.

MSC:

90B30 Production models

Software:

ElemStatLearn
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Moses, S.; Grant, H.; Gruenwald, L.; Pulat, S., Real-time due-date promising by build-to-order environments, International Journal of Production Research, 42, 20, 4353-4375 (2004) · Zbl 1060.90045
[2] Conway, R. W., Priority dispatching and job lateness in a job shop, Journal of Industrial Engineering, 16, 228-237 (1965)
[3] Shanthikumar, J. G.; Sumita, U., Approximations for the time spent in a dynamic job shop with applications to due-date assignment, International Journal of Production Research, 26, 1329-1352 (1988) · Zbl 0647.90038
[4] Wein, L. M., Due-date setting and priority sequencing in a multiclass M/G/1 queue, Management Science, 37, 834-850 (1991) · Zbl 0744.90031
[5] Duenyas, I., Single facility due date setting with multiple customer classes, Management Science, 41, 608-619 (1995) · Zbl 0836.90075
[6] Duenyas, I.; Hopp, W. J., Quoting customer lead times, Management Science, 41, 43-57 (1995) · Zbl 0829.90049
[7] Spearman, M. L.; Zhang, R. Q., Optimal lead time policies, Management Science, 45, 290-295 (1999) · Zbl 1231.90216
[8] Weng, Z. K., Strategies for integrating lead time and customer-order decisions, IIE Transactions, 31, 161-171 (1999)
[9] Hopp, W. J.; Sturgis, M. R., A simple, robust leadtime-quoting policy, Manufacturing & Service Operations Management, 3, 321-336 (2001)
[10] Gordon, V.; Proth, J.; Chu, C., A survey of the state-of-the-art of common due date assignment and scheduling research, European Journal of Operational Research, 139, 1-25 (2002) · Zbl 1009.90054
[11] Hastie, T.; Tibshirani, R.; Friedman, J. H., The elements of statistical learning: data mining, inference, and prediction (2003), Springer: Springer New York, NY
[12] Heard, E. L., Due-dates and instantaneous load in the one-machine shop, Management Science, 23, 444-450 (1976) · Zbl 0338.90040
[13] Seidmann, A.; Smith, M. L., Due date assignment for production systems, Management Science, 27, 571-581 (1981) · Zbl 0456.90038
[14] Cheng, T. C.E., Optimal TWK-power due-date determination and sequencing, International Journal of Systems Sciences, 18, 1-7 (1987) · Zbl 0615.90067
[15] De, P.; Ghosh, J. B.; Wells, C. E., Optimal due-date assignment and sequencing, European Journal of Operational Research, 57, 323-331 (1992) · Zbl 0761.90058
[16] Roman, D. B.; del Valle, A. G., Dynamic assignation of due-dates in an assembly shop based in simulation, International Journal of Production Research, 34, 1539-1554 (1996) · Zbl 0927.90039
[17] Grant, H.; Goldsman, D.; Moses, S., Using simulation to evaluate buffer adjustment methods in order promising, (Proceedings of the 2002 winter simulation conference. Proceedings of the 2002 winter simulation conference, San Diego, CA (2002))
[18] Lawrence, S. R., Estimating flowtimes and setting due-dates in complex production systems, IIE Transactions, 27, 657-668 (1995)
[19] Vapnik, V. N., The nature of statistical learning theory (2000), Springer: Springer New York · Zbl 0934.62009
[20] Yang H, Chan L, King I. Support vector machine regression for volatile stock market prediction. In: Yin H, et al., editors. IDEAL 2002, Lecture notes in Computer Science, vol. 2412. Berlin: Springer; 2002. p. 391-6.; Yang H, Chan L, King I. Support vector machine regression for volatile stock market prediction. In: Yin H, et al., editors. IDEAL 2002, Lecture notes in Computer Science, vol. 2412. Berlin: Springer; 2002. p. 391-6. · Zbl 1020.68956
[21] Yang H, King I, Chan L. Non-fixed and asymmetrical margin approach to stock market prediction using support vector regression. In: Proceedings of the international conference on neural information processing (ICONIP2002), Singapore, 2002.; Yang H, King I, Chan L. Non-fixed and asymmetrical margin approach to stock market prediction using support vector regression. In: Proceedings of the international conference on neural information processing (ICONIP2002), Singapore, 2002.
[22] Wu, C. H.; Ho, J. M.; Lee, D. T., Travel time prediction with support vector regression, IEEE Transactions on Intelligent Transportation Systems, 5, 276-281 (2003)
[23] Cherkassky V, Ma Y. Comparison of loss functions for linear regression. Proceedings of the 2004 IEEE International Joint Conference on Neural Networks, vol. 1, 25-29 July 2004. pp. 400-405.; Cherkassky V, Ma Y. Comparison of loss functions for linear regression. Proceedings of the 2004 IEEE International Joint Conference on Neural Networks, vol. 1, 25-29 July 2004. pp. 400-405.
[24] Schölkopf, B.; Smola, A. J., Learning with kernels: support vector machines, regularization, optimization, and beyond (2002), MIT Press: MIT Press Cambridge, MA
[25] Trafalis TB, Ince H, Mishina T. Support vector regression in option pricing. In: Workshop in soft computing for financial analysis, CJFER’03, Hong Kong, 2003.; Trafalis TB, Ince H, Mishina T. Support vector regression in option pricing. In: Workshop in soft computing for financial analysis, CJFER’03, Hong Kong, 2003.
[26] Trafalis TB, Ince H. Support vector machine for regression and applications to financial forecasting. In: IEEE-INNS-ENNS international joint conference on neural networks, Como, Italy, 2000.; Trafalis TB, Ince H. Support vector machine for regression and applications to financial forecasting. In: IEEE-INNS-ENNS international joint conference on neural networks, Como, Italy, 2000.
[27] Cherkassky, V.; Ma, Y., Practical selection of SVM parameters and noise estimation for SVM regression, Neural Networks, 17, 113-126 (2004) · Zbl 1075.68632
[28] Smola A, Schölkopf B. A tutorial on support vector regression. NeuroCOLT Technical Report NC-TR-98-030, Royal Holloway College, University of London, UK; 1998.; Smola A, Schölkopf B. A tutorial on support vector regression. NeuroCOLT Technical Report NC-TR-98-030, Royal Holloway College, University of London, UK; 1998.
[29] Gunn SR. Support vector machines for classification and regression. Technical Report, Department of Electronics and Computer Science, University of Southampton, UK; 1998.; Gunn SR. Support vector machines for classification and regression. Technical Report, Department of Electronics and Computer Science, University of Southampton, UK; 1998.
[30] Cristianini, N.; Shawe-Taylor, J., An introduction to support vector machines and other kernel-based learning methods (2000), Cambridge University Press: Cambridge University Press Cambridge, UK
[31] Little, J. D., A proof for the queueing formula \(L = \lambda W\), Operations Research, 9, 383-387 (1961) · Zbl 0108.14803
[32] Haykin, S., Neural networks: a comprehensive foundation (1999), Prentice-Hall: Prentice-Hall New Jersey · Zbl 0934.68076
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.