×

Makespan estimation in batch process industries: A comparison between regression analysis and neural networks. (English) Zbl 1012.90514

Summary: Batch processing is becoming more important in the process industries, because of the increasing product variety and the decreasing demand volumes for individual products. In batch process industries it is difficult to estimate the completion time, or makespan, of a set of jobs, because jobs interact at the shop floor. We assume a situation with hierarchical production control consisting of a planning level and a scheduling level. In this paper we focus on the planning level. We use two different techniques for estimating the makespan of job sets in batch process industries. The first technique estimates the makespan of a job set by developing regression models, the second technique by training neural networks. Both techniques use aggregate information. By using aggregate information the presented techniques are less time consuming in assessing the makespan of a job set compared with methods based on detailed information.
Tests on newly generated job sets showed that both techniques are robust for changes in the number of jobs, the average processing time, a more unbalanced workload and for different resource configurations. Finally, the estimation quality of the neural network models appears significantly better than the quality of regression models.

MSC:

90B35 Deterministic scheduling theory in operations research
92B20 Neural networks for/in biological studies, artificial life and related topics
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Andrews, R.; Diederich, J.; Tickle, A. B., A survey and critique of techniques for extracting rules from trained artificial neural networks, Knowledge Based System, 8, 373-389 (1995)
[2] Arizono, I.; Yamamoto, A.; Ohta, H., Scheduling for minimizing total actual flow time by neural networks, International Journal of Production Research, 30, 503-511 (1992) · Zbl 0756.90048
[3] Baker, K. R.; Bertrand, J. W.M., An investigation of due-date assignment rules with constrained tightness, Journal of Operations Management, 1, 109-120 (1981)
[4] Baker, K. R.; Bertrand, J. W.M., A comparison of due-date selection rules, IIE Transactions, 13, 123-131 (1981)
[5] Bertrand, J. W.M., The effects of workload dependent due-dates on job shop performance, Management Science, 29, 799-816 (1983)
[6] Chen, W.; Muraki, M., An action strategy generation framework for on-line scheduling and control system in batch processing with neural networks, International Journal of Production Research, 35, 3483-3506 (1997) · Zbl 0942.90551
[7] Cheng, T. C.E.; Gupta, M. C., Survey of scheduling research involving due date determination decisions, European Journal of Operational Research, 38, 156-166 (1989) · Zbl 0658.90049
[8] Eilon, S.; Chowdhury, I. G., Due dates in job shop scheduling, International Journal of Production Research, 14, 223-237 (1976)
[9] Enns, S. T., Job shop flowtime prediction and tardiness control using queueing analysis, International Journal of Production Research, 31, 2045-2057 (1993)
[10] Enns, S. T., A dynamic forecasting model for job shop flowtime prediction and tardiness control, International Journal of Production Research, 33, 1295-1312 (1995) · Zbl 0916.90123
[11] Enns, S. T., Lead time selection and behaviour of work flow in job shops, European Journal of Operational Research, 109, 122-136 (1998) · Zbl 0951.90023
[12] Hill, T.; Remus, W., Neural network models for intelligent support of managerial decision making, Decision Support Systems, 11, 449-459 (1994)
[13] Huang, C. L.; Huang, Y. H.; Chang, T. Y.; Chang, S. H.; Chung, C. H.; Huang, D. T.; Li, R. K., The construction of production performance prediction system for semiconductor manufacturing with artificial neural networks, International Journal of Production Research, 37, 1387-1402 (1999) · Zbl 0949.90515
[14] Lawrence, S. R., Estimating flowtimes and setting due dates in complex production systems, IIE Transactions, 27, 657-668 (1995)
[15] Lee, Y. H.; Kim, S., Neural network applications for scheduling jobs on parallel machines, Computer and Industrial Engineering, 25, 227-230 (1993)
[16] Lenstra, J. K.; Rinnooy Kan, A. H.G.; Brucker, P., Complexity of machine scheduling problems, Annals of Discrete Mathematics, 1, 343-362 (1977) · Zbl 0301.90025
[17] Montgomery, D. C.; Peck, E. A., Introduction to Linear Regression Analysis (1992), Wiley: Wiley New York · Zbl 0850.62529
[18] Philipoom, P. R.; Rees, L. P.; Wiegemann, L., Using neural networks to determine internally-set due-date assignments for shop scheduling, Decision Sciences, 25, 825-851 (1994)
[19] Prechelt, L., 1994. Proben1: A set of neural network benchmark problems and benchmarking rules. Technical Report 24/94, Fakultät für Informatik, Universität Karlsruhe, Germany; Prechelt, L., 1994. Proben1: A set of neural network benchmark problems and benchmarking rules. Technical Report 24/94, Fakultät für Informatik, Universität Karlsruhe, Germany
[20] Raaymakers, W.H.M., 1999. Order acceptance and capacity loading in batch process industries. Ph.D. Thesis, Eindhoven University of Technology; Raaymakers, W.H.M., 1999. Order acceptance and capacity loading in batch process industries. Ph.D. Thesis, Eindhoven University of Technology
[21] Raaymakers, W. H.M.; Bertrand, J. W.M.; Fransoo, J. C., The performance of workload rules for order acceptance in batch chemical manufacturing, Journal of Intelligent Manufacturing, 11, 217-228 (2000)
[22] Raaymakers, W. H.M.; Hoogeveen, J. A., Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing, European Journal of Operational Research, 126, 131-151 (2000) · Zbl 0970.90034
[23] Raaymakers, W. H.M.; Fransoo, J. C., Identification of aggregate resource and job set characteristics for predicting job set makespan in batch process industries, International Journal of Production Economics, 68, 137-149 (2000)
[24] Raaymakers, W. H.M.; Bertrand, J. W.M.; Fransoo, J. C., Makespan estimation in batch process industries using aggregate resource and job set characteristics, International Journal of Production Economics, 70, 145-161 (2001)
[25] Ragatz, G. L.; Mabert, V. A., A simulation analysis of due date assignment rules, Journal of Operations Management, 5, 27-39 (1984)
[26] Rumelhart, D. E.; Hinton, G. E.; Williams, R. J., Learning internal representations by error propagation, (Rumelhart, D. E.; McClelland, J. L., Parallel Distributed Processing. Parallel Distributed Processing, Explorations in the Microstructure of Cognition: Foundations, vol 1 (1986), MIT Press: MIT Press Cambridge, MA), 318-362
[27] Sabuncuoglu, I.; Gurgun, B., A neural network model for scheduling problems, European Journal of Operational Reseach, 93, 288-299 (1996) · Zbl 0913.90180
[28] Sabuncuoglu, I., Scheduling with neural networks – a review of the literature and new research directions, Production Planning and Control, 9, 1, 2-12 (1998)
[29] Statake, T.; Katsumi, M.; Nakamura, N., Neural network approach for minimizing the makespan of the general job-shop, International Journal of Production Economics, 33, 67-74 (1994)
[30] Vig, M. M.; Dooley, K. J., Dynamic rules for due-date assignment, International Journal of Production Research, 29, 1361-1377 (1991)
[31] Vig, M. M.; Dooley, K. J., Mixing static and dynamic flowtime estimates for due-date assignment, Journal of Operations Management, 11, 67-79 (1993)
[32] Weeks, J. K., A simulation study of predictable due-dates, Management Science, 25, 363-373 (1979) · Zbl 0409.90041
[33] Weijters, A. J.M. M.; van den Bosch, A. P.J., Interpreting knowledge representations in BP-SOM, Behaviormetrika, 26, 107-129 (1999)
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.