Flowshop scheduling with artificial neural networks

References

• Abdel-Basset, M., Abdel-Fatah, L., & Sangaiah, A. K. (2018). Metaheuristic algorithms: A comprehensive review. In Computational intelligence for multimedia big data on the cloud with engineering applications (pp. 185–231). Amsterdam, Holland: Elsevier Academic Press.
   Google Scholar
• Abdel-Basset, M., Manogaran, G., El-Shahat, D., & Mirjalili, S. (2018). A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Generation Computer Systems, 85, 129–145. doi:10.1016/j.future.2018.03.020
   Web of Science ®Google Scholar
• Agarwal, A., Jacob, V. S., & Pirkul, H. (2006). An improved augmented neural-network approach for scheduling problems. INFORMS Journal on Computing, 18(1), 119–128. doi:10.1287/ijoc.1040.0108
   Web of Science ®Google Scholar
• Akyol, D. E. (2004). Application of neural networks to heuristic scheduling algorithms. Computers and Industrial Engineering, 46(4), 679–696. doi:10.1016/j.cie.2004.05.005
   Web of Science ®Google Scholar
• Akyol, D. E., & Bayhan, G. M. (2007). A review on evolution of production scheduling with neural networks. Computers and Industrial Engineering, 53(1), 95–122. doi:10.1016/j.cie.2007.04.006
   Web of Science ®Google Scholar
• Andersen, T. J., & Wilamowski, B. M. (1995). A modified regression algorithm for fast one layer neural network training. In Proceedings of the world congress of neural networks, Washington DC (pp. 687–690).
   Google Scholar
• Bajramovic, F., Gruber, C., & Sick, B. (2004). A comparison of first- and second-order training algorithms for dynamic neural networks. In Proceedings of the IEEE international joint conference on neural networks) (Vol. 2, pp. 837–842).
   Google Scholar
• Baker, K. R., & Trietsch, D. (2013). Principles of sequencing and scheduling. Hoboken, NJ: Wiley.
   Google Scholar
• Battiti, R. (1989). Accelerated backpropagation learning: Two optimization methods. Complex Systems, 3(4), 331–342.
   Google Scholar
• Battiti, R. (1992). First- and second-order methods for learning: Between steepest descent and newton’s method. Neural Computation, 4(2), 141–166. doi:10.1162/neco.1992.4.2.141
   Web of Science ®Google Scholar
• Broyden, C. G. (1970). The convergence of a class of double-rank minimization algorithms 1. general considerations. IMA Journal of Applied Mathematics, 6(1), 76–90. doi:10.1093/imamat/6.1.76
   Google Scholar
• Cakar, T., Yildirim, M. B., & Barut, M. (2005). A neuro-genetic approach to design and planning of a manufacturing cell. Journal of Intelligent Manufacturing, 16(4-5), 453–462. doi:10.1007/s10845-005-1657-2
   Web of Science ®Google Scholar
• Campbell, H. G., Dudek, R. A., & Smith, M. L. (1970). A heuristic algorithm for the n job, m machine sequencing problem. Management Science, 16 (10), B-630–B-637. doi:10.1287/mnsc.16.10.B630
   Web of Science ®Google Scholar
• Chan, L.-W., & Fallside, F. (1987). An adaptive training algorithm for back propagation networks. Computer Speech and Language, 2(3-4), 205–218. doi:10.1016/0885-2308(87)90009-X
   Google Scholar
• Chang-Xue, J. F., Yu, Z.-G. S., Kingi, U., & Baig, M. P. (2005). Threefold vs. fivefold cross validation in one-hidden-layer and two-hidden-layer predictive neural network modeling of machining surface roughness data. Journal of Manufacturing Systems, 24(2), 93–107. doi:10.1016/S0278-6125(05)80010-X
   Web of Science ®Google Scholar
• Davidon, W. (1959). Variable metric algorithm for minimization. Report, Argonne National Laboratory.
   Google Scholar
• Dong, X., Huang, H., & Chen, P. (2008). An improved neh-based heuristic for the permutation flowshop problem. Computers & Operations Research, 35(12), 3962–3968. doi:10.1016/j.cor.2007.05.005
   Web of Science ®Google Scholar
• Eguchi, T., Oba, F., & Toyooka, S. (2008). A robust scheduling rule using a neural network in dynamically changing job-shop environments. International Journal of Manufacturing Technology and Management, 14(3/4), 266–288. doi:10.1504/IJMTM.2008.017727
   Google Scholar
• El-Bouri, A., Balakrishnan, S., & Popplewell, N. (2000). Sequencing jobs on a single machine: A neural network approach. European Journal of Operational Research, 126(3), 474–490. doi:10.1016/S0377-2217(99)00302-1
   Web of Science ®Google Scholar
• El-Bouri, A., Balakrishnan, S., & Popplewell, N. (2005). A neural network to enhance local search in the permutation flowshop. Computers and Industrial Engineering, 49(1), 182–196. doi:10.1016/j.cie.2005.04.001
   Web of Science ®Google Scholar
• Fhahlman, S. E. (1988). Faster-learning variations on back-propagation: An empirical study. In Proc. 1988 Connectionist Models Summer School (pp. 38–51).
   Google Scholar
• Fletcher, R. (1970). A new approach to variable metric algorithms. The Computer Journal, 13(3), 317–322. doi:10.1093/comjnl/13.3.317
   Web of Science ®Google Scholar
• Fletcher, R., & Powell, M. J. D. (1963). A rapidly convergent descent method for minimization. The Computer Journal, 6(2), 163–168. doi:10.1093/comjnl/6.2.163
   Web of Science ®Google Scholar
• Framinan, J. M., Gupta, J. N. D., & Leisten, R. (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society, 55(12), 1243–1255. doi:10.1057/palgrave.jors.2601784
   Web of Science ®Google Scholar
• Framinan, J. M., & Nagano, M. S. (2008). Evaluating the performance for makespan minimisation in no-wait flowshop sequencing. Journal of Materials Processing Technology, 197(1-3), 1–9. doi:10.1016/j.jmatprotec.2007.07.039
   Web of Science ®Google Scholar
• Gholami, O., & Sotskov, Y. N. (2014). A neural network algorithm for servicing jobs with sequential and parallel machines. Automation and Remote Control, 75(7), 1203–1220. doi:10.1134/S0005117914070030
   Web of Science ®Google Scholar
• Goldfarb, D. (1970). A family of variable-metric methods derived by variational means. Mathematics of Computation, 24(109), 23–26. doi:10.1090/S0025-5718-1970-0258249-6
   Web of Science ®Google Scholar
• Gong, L., Liu, C., Li, Y., & Fuqing, Y. (2012). Training feed-forward neural networks using the gradient descent method with the optimal stepsize. Journal of Computational Information Systems, 8(4), 1359–1371.
   Google Scholar
• Gupta, J. N. D. (1971). A functional heuristic algorithm for the flowshop scheduling problem. Journal of the Operational Research Society, 22(1), 39–47. doi:10.1057/jors.1971.18
   Web of Science ®Google Scholar
• Gupta, J. N. D., Sexton, R. S., & Tunc, E. A. (2000). Selecting scheduling heuristics using neural networks. INFORMS Journal on Computing, 12(2), 150–162. doi:10.1287/ijoc.12.2.150.11893
   Web of Science ®Google Scholar
• Gupta, J. N. D., & Stafford, E. F. (2006). Flowshop scheduling research after five decades. European Journal of Operational Research, 169(3), 699–711. doi:10.1016/j.ejor.2005.02.001
   Web of Science ®Google Scholar
• Hagan, M. T., & Menhaj, M. B. (1994). Training feedforward networks with the Marquardt algorithm. IEEE Transactions on Neural Networks, 5(6), 989–993. doi:10.1109/72.329697
   PubMed Web of Science ®Google Scholar
• Haq, A. N., & Radha Ramanan, T. (2006). A bicriterian flow shop scheduling using artificial neural network. The International Journal of Advanced Manufacturing Technology, 30 (11-12), 1132. doi:10.1007/s00170-005-0135-5
   Web of Science ®Google Scholar
• Haq, A. N., Radha Ramanan, T., Shashikant, K. S., & Sridharan, R. (2010). A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling. International Journal of Production Research, 48(14), 4217–4231. doi:10.1080/00207540802404364
   Web of Science ®Google Scholar
• Hejazi, S. R., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: A review. International Journal of Production Research, 43(14), 2895–2929. doi:10.1080/0020754050056417
   Web of Science ®Google Scholar
• Hsin, H.-C., Li, C.-C., Sun, M., & Sclabassi, R. J. (1995). An adaptive training algorithm for back-propagation neural networks. IEEE Transactions on Systems, Man, and Cybernetics, 25(3), 512–514. doi:10.1109/21.364864
   Web of Science ®Google Scholar
• Jacobs, R. A. (1988). Increased rates of convergence through learning rate adaptation. Neural Networks, 1(4), 295–307. doi:10.1016/0893-6080(88)90003-2
   Web of Science ®Google Scholar
• Jain, V., & Raj, T. (2018). An adaptive neuro-fuzzy inference system for makespan estimation of flexible manufacturing system assembly shop: A case study. International Journal of System Assurance Engineering and Management, 9(6), 1302–1314. doi:10.1007/s13198-018-0729-6
   Web of Science ®Google Scholar
• Kamruzzaman, J., Begg, R., & Sarker, R. A. (2006). Artificial neural networks in finance and manufacturing. Hershey, PA: IGI Global.
   Google Scholar
• Kechadi, M.-T., Low, K. S., & Goncalves, G. (2013). Recurrent neural network approach for cyclic job shop scheduling problem. Journal of Manufacturing Systems, 32(4), 689–699. doi:10.1016/j.jmsy.2013.02.001
   Web of Science ®Google Scholar
• Kumar, H. (2018). Computational intelligence approach for flow shop scheduling problem. In Handbook of Research on Emergent Applications of Optimization Algorithms (pp. 298–313). Hershey, PA: IGI Global.
   Google Scholar
• Laha, D., & Chakraborty, U. K. (2007). An efficient stochastic hybrid heuristic for flowshop scheduling. Engineering Applications of Artificial Intelligence, 20(6), 851–856. doi:10.1016/j.engappai.2006.10.003
   Web of Science ®Google Scholar
• Laha, D., & Chakraborty, U. K. (2009). An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 44(5-6), 559–569. doi:10.1007/s00170-008-1845-2
   Web of Science ®Google Scholar
• Laha, D., & Gupta, J. N. D. (2016). A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops. Computers and Industrial Engineering, 98, 373–383. doi:10.1016/j.cie.2016.06.003
   Web of Science ®Google Scholar
• Laha, D., Gupta, J. N. D., & Sapkal, S. U. (2014). A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops. Journal of the Operational Research Society, 65(10, 1611–1624. doi:10.1057/jors.2013.118
   Web of Science ®Google Scholar
• Laha, D., Ren, Y., & Suganthan, P. N. (2015). Modeling of steelmaking process with effective machine learning techniques. Expert Systems with Applications, 42(10, 4687–4696. doi:10.1016/j.eswa.2015.01.030
   Web of Science ®Google Scholar
• Laha, D., & Sapkal, S. U. (2014). An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop. Computers and Industrial Engineering, 67, 36–43. doi:10.1016/j.cie.2013.08.026
   Web of Science ®Google Scholar
• Lee, I., & Shaw, M. J. (2000). A neural-net approach to real time flow-shop sequencing. Computers and Industrial Engineering, 38(1), 125–147. doi:10.1016/S0360-8352(00)00034-6
   Web of Science ®Google Scholar
• Li, S.-J., Li, Y., Liu, Y., Liu, Z.-G., & Tang, J. (2005). Hybrid method of bpn and genetic algorithm for completion time prediction. In Proceedings of the international conference on machine learning and cybernetics (Vol. 8, pp. 4625–4630).
   Google Scholar
• Likas, A., & Stafylopatis, A. (2000). Training the random neural network using quasi-newton methods. European Journal of Operational Research, 126(2), 331–339. doi:10.1016/S0377-2217(99)00482-8
   Web of Science ®Google Scholar
• Liu, W., Jin, Y., & Price, M. (2017). A new improved neh heuristic for permutation flowshop scheduling problems. International Journal of Production Economics, 193, 21–30. doi:10.1016/j.ijpe.2017.06.026
   Web of Science ®Google Scholar
• Magoulas, G. D., Vrahatis, M. N., & Androulakis, G. S. (1997). Effective backpropagation training with variable stepsize. Neural Networks, 10(1), 69–82. doi:10.1016/S0893-6080(96)00052-4
   PubMed Web of Science ®Google Scholar
• Majumder, A., & Laha, D. (2016). A new cuckoo search algorithm for 2-machine robotic cell scheduling problem with sequence-dependent setup times. Swarm and Evolutionary Computation, 28, 131–143. doi:10.1016/j.swevo.2016.02.001
   Web of Science ®Google Scholar
• Matott, L. S., Leung, K., & Sim, J. (2011). Application of matlab and python optimizers to two case studies involving groundwater flow and contaminant transport modeling. Computers and Geosciences, 37(11), 1894–1899. doi:10.1016/j.cageo.2011.03.017
   Web of Science ®Google Scholar
• Minai, A. A. (1990). Acceleration of backpropagation through learning rate and momentum adaptation. In Proceedings of the international joint conference on neural networks (pp. 676–679).
   Google Scholar
• Minai, A. A., Williams, R. D. (1990). Back-propagation heuristics: a study of the extended delta-bar-delta algorithm. In Proceedings of the international joint conference on neural networks (vol. 1, pp. 595–600).
   Google Scholar
• Mokhtari, H., Abadi, I. N. K., & Cheraghalikhani, A. (2011). A multi-objective flow shop scheduling with resource-dependent processing times: Trade-off between makespan and cost of resources. International Journal of Production Research, 49(19), 5851–5875. doi:10.1080/00207543.2010.523724
   Web of Science ®Google Scholar
• Mokotoff, E. (2004). An exact algorithm for the identical parallel machine scheduling problem. European Journal of Operational Research, 152(3), 758–769. doi:10.1016/S0377-2217(02)00726-9
   Web of Science ®Google Scholar
• Moreira, M., & Fiesler, E. (1995). Neural networks with adaptive learning rate and momentum terms (Tech. Rep.). CASE POSTALE 609 - 1920 MARTIGNY - VALAIS - SUISSE Institut Dalle Molle D′Intelligence Artificielle Perceptive.
   Google Scholar
• Mukherjee, I., & Routroy, S. (2012). Comparing the performance of neural networks developed by using Levenberg-Marquardt and quasi-newton with the gradient descent algorithm for modelling a multiple response grinding process. Expert Systems with Applications, 39(3), 2397–2407. doi:10.1016/j.eswa.2011.08.087
   Web of Science ®Google Scholar
• Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91–95. doi:10.1016/0305-0483(83)90088-9
   Web of Science ®Google Scholar
• Palmer, D. S. (1965). Sequencing jobs through a multi-stage process in the minimum total time - a quick method of obtaining a near optimum. Journal of the Operational Research Society, 16(1), 101–107. doi:10.1057/jors.1965.8
   Google Scholar
• Peng, C.-C., & Magoulas, G. D. (2011a). Nonmonotone bfgs-trained recurrent neural networks for temporal sequence processing. Applied Mathematics and Computation, 217(12), 5421–5441. doi:10.1016/j.amc.2010.12.012
   Web of Science ®Google Scholar
• Peng, C.-C., & Magoulas, G. D. (2011b). Nonmonotone Levenberg–Marquardt training of recurrent neural architectures for processing symbolic sequences. Neural Computing and Applications, 20(6), 897–908. doi:10.1007/s00521-010-0493-2
   Web of Science ®Google Scholar
• Pfister, M., & Rojas, R. (1993). Speeding-up backpropagation-a comparison of orthogonal techniques. In Proceedings of 1993 international conference on neural networks (vol. 1, pp. 517–523).
   Google Scholar
• Pinedo, M. L. (2016). Scheduling: theory, algorithms, and systems (5th ed.). New York: Springer.
   Google Scholar
• Plagianakos, V. P., Magoulas, G. D., & Vrahatis, M. N. (2001). Learning rate adaptation in stochastic gradient descent. In Advances in convex analysis and global optimization (pp. 433–444). Boston: Springer.
   Google Scholar
• Plagianakos, V. P., Vrahatis, M. N., & Magoulas, G. D. (1999). Nonmonotone methods for backpropagation training with adaptive learning rate. In Proceedings of the international joint conference on neural networks (vol. 3, pp. 1762–1767).
   Google Scholar
• Prechelt, L. (1998). Early stopping but when? In Neural Networks: Tricks of the trade (pp. 55–69). Berlin: Springer.
   Google Scholar
• Radha Ramanan, T., Sridharan, R., Shashikant, K. S., & Haq, A. N. (2011). An artificial neural network based heuristic for flow shop scheduling problems. Journal of Intelligent Manufacturing, 22(2), 279–288. doi:10.1007/s10845-009-0287-5
   Web of Science ®Google Scholar
• Riedmiller, M., & Braun, H. (1993). A direct adaptive method for faster backpropagation learning: the rprop algorithm. In Proceedings of the IEEE international conference on neural networks (Vol. 1, pp. 586–591).
   Google Scholar
• Saini, L., & Soni, M. (2002). Artificial neural network based peak load forecasting using levenberg-marquardt and quasi-newton methods. IEEE Proceedings - Generation, Transmission and Distribution, 149(5), 578–584. doi:10.1049/ip-gtd:20020462
   Web of Science ®Google Scholar
• Sapkal, S. U., & Laha, D. (2013). A heuristic for no-wait flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 68(5-8), 1327–1338. doi:10.1007/s00170-013-4924-y
   Web of Science ®Google Scholar
• Sarkar, D. (1995). Methods to speed up error back-propagation learning algorithm. ACM Computing Surveys, 27(4), 519–544. doi:10.1145/234782.234785
   Web of Science ®Google Scholar
• Shafaei, R., Rabiee, M., & Mirzaeyan, M. (2011). An adaptive neuro fuzzy inference system for makespan estimation in multiprocessor no-wait two stage flow shop. International Journal of Computer Integrated Manufacturing, 24(10), 888–899. doi:10.1080/0951192X.2011.597430
   Web of Science ®Google Scholar
• Shah, S., & Palmieri, F. (1990). Meka-a fast, local algorithm for training feedforward neural networks. In Proceedings of the international joint conference on neural networks (vol. 3, pp. 41–46).
   Google Scholar
• Shambour, M. K. Y., Abusnaina, A. A., & Alsalibi, A. I. (2018). Modified global flower pollination algorithm and its application for optimization problems. Interdisciplinary Sciences: Computational Life Sciences, 1–12. doi: 10.1007/s12539-018-0295-2.
   Web of Science ®Google Scholar
• Shanno, D. F. (1970). Conditioning of quasi-newton methods for function minimization. Mathematics of Computation, 24(111), 647–656. doi:10.1090/S0025-5718-1970-0274029-X
   Web of Science ®Google Scholar
• Silva, F. M., & Almeida, L. B. (1990). Acceleration techniques for the backpropagation algorithm. In Neural Networks (pp. 110–119). Berlin: Springer.
   Google Scholar
• Smith, K. A., & Gupta, J. N. D. (2000). Neural networks in business: Techniques and applications for the operations researcher. Computers and Operations Research, 27(11), 1023–1044. doi:10.1016/S0305-0548(99)00141-0
   Web of Science ®Google Scholar
• Su, L.-H., & Lien, C.-Y. (2009). Scheduling parallel machines with resource-dependent processing times. International Journal of Production Economics, 117(2), 256–266. doi:10.1016/j.ijpe.2008.10.014
   Web of Science ®Google Scholar
• Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278–285. doi:10.1016/0377-2217(93)90182-M
   Web of Science ®Google Scholar
• Tang, L., Liu, W., & Liu, J. (2005). A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. Journal of Intelligent Manufacturing, 16(3), 361–370. doi:10.1007/s10845-005-7029-0
   Web of Science ®Google Scholar
• Tollenaere, T. (1990). Supersab: Fast adaptive back propagation with good scaling properties. Neural Networks, 3(5), 561–573. doi:10.1016/0893-6080(90)90006-7
   Web of Science ®Google Scholar
• Tseng, F. T., Gupta, J. N. D., & Stafford, E. F. (2006). A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times. Journal of the Operational Research Society, 57(5), 541–551. doi:10.1057/palgrave.jors.2602020
   Web of Science ®Google Scholar
• Vallada, E., Ruiz, R., & Framinan, J. M. (2015). New hard benchmark for flowshop scheduling problems minimising makespan. European Journal of Operational Research, 240(3), 666–677. doi:10.1016/j.ejor.2014.07.033
   Web of Science ®Google Scholar
• Vogl, T. P., Mangis, J. K., Rigler, A. K., Zink, W. T., & Alkon, D. L. (1988). Accelerating the convergence of the back-propagation method. Biological Cybernetics, 59(4-5), 257–263. doi:10.1007/BF00332914
   Web of Science ®Google Scholar
• Wang, H., Jacob, V., & Rolland, E. (2003). Design of efficient hybrid neural networks for flexible flow shop scheduling. Expert Systems, 20(4), 208–231. doi:10.1111/1468-0394.00245
   Web of Science ®Google Scholar
• Wang, J.-B., & Xia, Z.-Q. (2005). Flow-shop scheduling with a learning effect. Journal of the Operational Research Society, 56(11), 1325–1330. doi:10.1057/palgrave.jors.2601856
   Web of Science ®Google Scholar
• Weckman, G. R., Ganduri, C. V., & Koonce, D. A. (2008). A neural network job-shop scheduler. Journal of Intelligent Manufacturing, 19(2), 191–201. doi:10.1007/s10845-008-0073-9
   Web of Science ®Google Scholar
• Wilson, D. R., & Martinez, T. R. (2001). The need for small learning rates on large problems. In Proceedings of the international joint conference on neural networks (vol. 1, pp. 115–119).
   Google Scholar
• Zarandi, M. H. F., Mosadegh, H., & Fattahi, M. (2013). Two-machine robotic cell scheduling problem with sequence-dependent setup times. Computers and Operations Research, 40(5), 1420–1434. doi:10.1016/j.cor.2012.09.006
   Web of Science ®Google Scholar