1,120
Views
54
CrossRef citations to date
0
Altmetric
Articles

Automatic design of scheduling policies for dynamic flexible job shop scheduling via surrogate-assisted cooperative co-evolution genetic programming

ORCID Icon, &
Pages 2561-2580 | Received 18 Dec 2017, Accepted 16 Feb 2019, Published online: 27 May 2019

References

  • Azadeh, A., B. M. Shoja, M. Moghaddam, S. M. Asadzadeh, and A. Akbari. 2013. “A Neural Network Meta-Model for Identification of Optimal Combination of Priority Dispatching Rules and Makespan in a Deterministic Job Shop Scheduling Problem.” The International Journal of Advanced Manufacturing Technology 67 (5–8): 1549–1561. doi: 10.1007/s00170-012-4589-y
  • Baker, K. R. 1984. “Sequencing Rules and Due-Date Assignments in a Job Shop.” Management Science 30 (9): 1093–1104. doi: 10.1287/mnsc.30.9.1093
  • Branke, J., T. Hildebrandt, and B. Scholzreiter. 2015. “Hyper-heuristic Evolution of Dispatching Rules: A Comparison of Rule Representations.” Evolutionary Computation 23 (2): 249–277. doi: 10.1162/EVCO_a_00131
  • Branke, J., S. Nguyen, C. W. Pickardt, and M. Zhang. 2016. “Automated Design of Production Scheduling Heuristics: A Review.” IEEE Transactions on Evolutionary Computation 20 (1): 110–124. doi: 10.1109/TEVC.2015.2429314
  • Burke, E. K., K. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. Özcan, and Q. Rong. 2013. “Hyper-Heuristics: A Survey of the State of the Art.” Journal of the Operational Research Society 64 (12): 1695–1724. doi: 10.1057/jors.2013.71
  • Çaliş, B., and S. Bulkan. 2013. “A Research Survey: Review of AI Solution Strategies of Job Shop Scheduling Problem.” Journal of Intelligent Manufacturing 26 (5): 1–13.
  • Chiang, T. C. 2013. “Enhancing Rule-Based Scheduling in Wafer Fabrication Facilities by Evolutionary Algorithms: Review and Opportunity.” Computers & Industrial Engineering 64 (1): 524–535. doi: 10.1016/j.cie.2012.08.009
  • Demšar, J. 2006. “Statistical Comparisons of Classifiers Over Multiple Data Sets.” Journal of Machine Learning Research 7: 1–30.
  • Ding, K., P. Y. Jiang, and S. L. Su. 2018. “RFID-Enabled Social Manufacturing System for Inter-Enterprise Monitoring and Dispatching of Integrated Production and Transportation Tasks.” Robotics and Computer-Integrated Manufacturing 49: 120–133. doi: 10.1016/j.rcim.2017.06.009
  • urasević, M., and D. Jakobović. 2018a. “Evolving Dispatching Rules for Optimising Many-Objective Criteria in the Unrelated Machines Environment.” Genetic Programming and Evolvable Machines 19 (1–2): 9–51. doi: 10.1007/s10710-017-9310-3
  • urasević, M., and D. Jakobović. 2018b. “Comparison of Ensemble Learning Methods for Creating Ensembles of Dispatching Rules for the Unrelated Machines Environment.” Genetic Programming and Evolvable Machines 19 (1–2): 53–92. doi: 10.1007/s10710-017-9302-3
  • El-Bouri, A., S. Balakrishnan, and N. Popplewell. 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
  • Esmaeilian, B., S. Behdad, and B. Wang. 2016. “The Evolution and Future of Manufacturing: A Review.” Journal of Manufacturing Systems 39: 79–100. doi: 10.1016/j.jmsy.2016.03.001
  • Ferreira, C. 2001. “Gene Expression Programming: A New Adaptive Algorithm for Solving Problems.” Complex. System 13 (2): 87–129.
  • Garey, M. R., D. S. Johnson, and R. Sethi. 1976. “The Complexity of Flowshop and Jobshop Scheduling.” Mathematics of Operations Research 1 (2): 117–129. doi: 10.1287/moor.1.2.117
  • Hildebrandt, T., and J. Branke. 2015. “On Using Surrogates with Genetic Programming.” Evolutionary Computation 23 (3): 343–367. doi: 10.1162/EVCO_a_00133
  • Hildebrandt, T., D. Goswami, and M. Freitag. 2014. “Large-scale Simulation-Based Optimization of Semiconductor Dispatching Rules.” Paper presented at the winter simulation conference, Savanah, GA, IEEE Press, December 7–10.
  • Hildebrandt, T., J. Heger, and B. Scholz-Reiter. 2010. “Towards Improved Dispatching Rules for Complex Shop Floor Scenarios: A Genetic Programming Approach.” Paper presented at the 12th annual conference on genetic and evolutionary computation, Portland, OR, ACM, July 7–11.
  • Ingimundardottir, H., and T. P. Runarsson. 2018. “Discovering Dispatching Rules From Data Using Imitation Learning: A Case Study for the Job-Shop Problem.” Journal of Scheduling 21 (4): 413–428. doi: 10.1007/s10951-017-0534-0
  • Kapanoglu, M., and M. Alikalfa. 2011. “Learning If–Then Priority Rules for Dynamic Job Shops Using Genetic Algorithms.” Robotics and Computer-Integrated Manufacturing 27 (1): 47–55. doi: 10.1016/j.rcim.2010.06.001
  • Korytkowski, P., S. Rymaszewski, and T. Wiśniewski. 2013. “Ant Colony Optimization for Job Shop Scheduling Using Multi-Attribute Dispatching Rules.” The International Journal of Advanced Manufacturing Technology 67 (1–4): 231–241. doi: 10.1007/s00170-013-4769-4
  • Koza, J. R. 1994. “Genetic Programming as a Means for Programming Computers by Natural Selection.” Statistics and Computing 4 (2): 87–112. doi: 10.1007/BF00175355
  • Lei, D. 2012. “Co-evolutionary Genetic Algorithm for Fuzzy Flexible Job Shop Scheduling.” Applied Soft Computing 12 (8): 2237–2245. doi: 10.1016/j.asoc.2012.03.025
  • Li, X., and S. Olafsson. 2005. “Discovering Dispatching Rules Using Data Mining.” Journal of Scheduling 8 (6): 515–527. doi: 10.1007/s10951-005-4781-0
  • Luke, S., and L. Panait. 2006. “A Comparison of Bloat Control Methods for Genetic Programming.” Evolutionary Computation 14 (3): 309–344. doi: 10.1162/evco.2006.14.3.309
  • Mei, Y., S. Nguyen, B. Xue, and M. Zhang. 2017. “An Efficient Feature Selection Algorithm for Evolving Job Shop Scheduling Rules with Genetic Programming.” IEEE Transactions on Emerging Topics in Computational Intelligence 1 (5): 339–353. doi: 10.1109/TETCI.2017.2743758
  • Nguyen, S., Y. Mei, B. Xue, and M. Zhang. 2018. “A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules.” Evolutionary Computation, 2018: 1–31. doi: 10.1162/evco_a_00230
  • Nguyen, S., Y. Mei, and M. Zhang. 2017. “Genetic Programming for Production Scheduling: A Survey with a Unified Framework.” Complex & Intelligent Systems 3 (1): 41–66. doi: 10.1007/s40747-017-0036-x
  • Nguyen, S., M. Zhang, M. Johnston, and K. C. Tan. 2014a. “Automatic Design of Scheduling Policies for Dynamic Multi-Objective Job Shop Scheduling via Cooperative Coevolution Genetic Programming.” IEEE Transactions on Evolutionary Computation 18 (2): 193–208. doi: 10.1109/TEVC.2013.2248159
  • Nguyen, S., M. Zhang, M. Johnston, and K. C. Tan. 2014b. “Selection Schemes in Surrogate-assisted Genetic Programming for Job shop Scheduling.” Paper presented at the Asia-Pacific conference on simulated evolution and learning, Dunedin, December, 15–18. Springer.
  • Nguyen, S., M. Zhang, and K. C. Tan. 2016. “Surrogate-assisted Genetic Programming with Simplified Models for Automated Design of Dispatching Rules.” IEEE Transactions on Cybernetics 47 (9): 2951–2965. doi: 10.1109/TCYB.2016.2562674
  • Nie, L., L. Gao, P. Li, and X. Li. 2013. “A GEP-Based Reactive Scheduling Policies Constructing Approach for Dynamic Flexible Job Shop Scheduling Problem with Job Release Dates.” Journal of Intelligent Manufacturing 24 (4): 763–774. doi: 10.1007/s10845-012-0626-9
  • Nie, L., X. Shao, L. Gao, and W. Li. 2010. “Evolving Scheduling Rules with Gene Expression Programming for Dynamic Single-Machine Scheduling Problems.” The International Journal of Advanced Manufacturing Technology 50 (5–8): 729–747. doi: 10.1007/s00170-010-2518-5
  • Olafsson, S., and X. Li. 2010. “Learning Effective New Single Machine Dispatching Rules From Optimal Scheduling Data.” International Journal of Production Economics 128 (1): 118–126. doi: 10.1016/j.ijpe.2010.06.004
  • Paolo, P., G. Alberto, P. Raul, and R. Rafael. 2014. “Dynamic Scheduling of Manufacturing Systems Using Machine Learning: An Updated Review.” Artificial Intelligence for Engineering Design, Analysis and Manufacturing 28 (1): 83–97. doi: 10.1017/S0890060413000516
  • Park, J., Y. Mei, S. Nguyen, G. Chen, and M. Zhang. 2018. “An Investigation of Ensemble Combination Schemes for Genetic Programming Based Hyper-Heuristic Approaches to Dynamic Job Shop Scheduling.” Applied Soft Computing 63: 72–86. doi: 10.1016/j.asoc.2017.11.020
  • Pickardt, C. W., T. Hildebrandt, J. Branke, J. Heger, and B. Scholz-Reiter. 2013. “Evolutionary Generation of Dispatching Rule Sets for Complex Dynamic Scheduling Problems.” International Journal of Production Economics 145 (1): 67–77. doi: 10.1016/j.ijpe.2012.10.016
  • Pinedo, M., and M. Singer. 1999. “A Shifting Bottleneck Heuristic for Minimizing the Total Weighted Tardiness in a Job Shop.” Naval Research Logistics 46 (1): 1–17. doi: 10.1002/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#
  • Potter, M. A., and K. A. D. Jong. 2000. “Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents.” Evolutionary Computation 8 (1): 1–29. doi: 10.1162/106365600568086
  • Tay, J. C., and N. B. Ho. 2008. “Evolving Dispatching Rules Using Genetic Programming for Solving Multi-Objective Flexible Job-Shop Problems.” Computers & Industrial Engineering 54 (3): 453–473. doi: 10.1016/j.cie.2007.08.008
  • Weckman, G. R., C. V. Ganduri, and D. A. Koonce. 2008. “A Neural Network Job-Shop Scheduler.” Journal of Intelligent Manufacturing 19 (2): 191–201. doi: 10.1007/s10845-008-0073-9
  • Wolpert, D. H., and W. G. Macready. 1997. “No Free Lunch Theorems for Optimization.” IEEE Transactions on Evolutionary Computation 1 (1): 67–82. doi: 10.1109/4235.585893
  • Xing, L. N., Y. W. Chen, and K. W. Yang. 2011. “Multi-population Interactive Coevolutionary Algorithm for Flexible Job Shop Scheduling Problems.” Computational Optimization and Applications 48 (1): 139–155. doi: 10.1007/s10589-009-9244-7
  • Yska, D., Y. Mei, and M. Zhang. 2018. “Genetic Programming Hyper-Heuristic with Cooperative Coevolution for Dynamic Flexible Job Shop Scheduling.” Paper presented at the European Conference on Genetic Programming, Parma, April 4–6. Springer.
  • Zhang, F., Y. Mei, and M. Zhang. 2018. “Surrogate-assisted Genetic Programming for Dynamic Flexible Job Shop Scheduling.” Paper presented at the 31st Australasian Joint conference on artificial intelligence, Wellington, December 11–14. Springer.
  • Zhang, J., and J. Yang. 2016. “Flexible Job-Shop Scheduling with Flexible Workdays, Preemption, Overlapping in Operations and Satisfaction Criteria: An Industrial Application.” International Journal of Production Research 54 (16): 1–25.
  • Zhang, J., J. Yang, and Y. Zhou. 2016. “Robust Scheduling for Multi-Objective Flexible Job-Shop Problems with Flexible Workdays.” Engineering Optimization 48 (11): 1973–1989. doi: 10.1080/0305215X.2016.1145216
  • Zhou, Y., J. Yang, and L. Zheng. 2019. “Hyper-Heuristic Coevolution of Machine Assignment and Job Sequencing Rules for Multi-objective Dynamic Flexible Job Shop Scheduling.” IEEE Access 7: 68–88. doi: 10.1109/ACCESS.2018.2883802

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.