{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:21:15Z","timestamp":1747196475035,"version":"3.40.5"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135625"},{"type":"electronic","value":"9783319135632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13563-2_55","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:36:25Z","timestamp":1415961385000},"page":"656-667","source":"Crossref","is-referenced-by-count":18,"title":["Selection Schemes in Surrogate-Assisted Genetic Programming for Job Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Su","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Mengjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Johnston","sequence":"additional","affiliation":[]},{"given":"Kay Chen","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"55_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10951-006-5591-8","volume":"9","author":"C.D. Geiger","year":"2006","unstructured":"Geiger, C.D., Uzsoy, R., Aytu\u011f, H.: Rapid modeling and discovery of priority dispatching rules: an autonomous learning approach. J. of Sched.\u00a09(1), 7\u201334 (2006)","journal-title":"J. of Sched."},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Hildebrandt, T., Heger, J., Scholz-Reiter, B.: Towards improved dispatching rules for complex shop floor scenarios \u2014 a genetic programming approach. In: GECCO 2010: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 257\u2013264 (2010)","DOI":"10.1145\/1830483.1830530"},{"issue":"2","key":"55_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TEVC.2013.2248159","volume":"18","author":"S. Nguyen","year":"2014","unstructured":"Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution GP. IEEE Transactions on Evolutionary Computation\u00a018(2), 193\u2013208 (2014)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"55_CR4","unstructured":"Banzhaf, W., Nordin, P., Keller, R., Francone, F.: Genetic Programming: An Introduction. Morgan Kaufmann (1998)"},{"key":"55_CR5","volume-title":"Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence","author":"C. Ferreira","year":"2006","unstructured":"Ferreira, C.: Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence, 2nd edn. Springer, Germany (2006)","edition":"2"},{"key":"55_CR6","series-title":"SCI","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-39304-4_10","volume-title":"Automated Scheduling and Planning","author":"S. Nguyen","year":"2013","unstructured":"Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Dynamic multi-objective job shop scheduling: A genetic programming approach. In: Uyar, A.S., Ozcan, E., Urquhart, N. (eds.) Automated Scheduling and Planning. SCI, vol.\u00a0505, pp. 251\u2013282. Springer, Heidelberg (2013)"},{"key":"55_CR7","unstructured":"Hildebrandt, T., Branke, J.: On using surrogates with genetic programming. Technical report, Warwick Business School (2014)"},{"key":"55_CR8","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M.L. Pinedo","year":"2008","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 3rd edn. Springer, New York (2008)","edition":"3"},{"key":"55_CR9","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science\u00a042, 797\u2013813 (1996)","journal-title":"Management Science"},{"key":"55_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, V.H.L., Crawford, L.S., Menon, P.K.: Air traffic control using genetic search techniques. In: Proceedings of the 1999 IEEE International Conference on Control Applications, vol.\u00a01, pp. 249\u2013254 (1999)","DOI":"10.1109\/CCA.1999.806209"},{"issue":"4","key":"55_CR11","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.cie.2006.09.002","volume":"51","author":"D. Sha","year":"2006","unstructured":"Sha, D., Hsu, C.Y.: A hybrid particle swarm optimization for job shop scheduling problem. Computers & Industrial Engineering\u00a051(4), 791\u2013808 (2006)","journal-title":"Computers & Industrial Engineering"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Philipoom, P., Russell, R.S., Fry, T.D.: A preliminary investigation of multi-attribute based sequencing rules for assembly shops. International Journal of Production Research 29(4) (1991)","DOI":"10.1080\/00207549108930099"},{"key":"55_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-540-71605-1_30","volume-title":"Genetic Programming","author":"D. Jakobovi\u0107","year":"2007","unstructured":"Jakobovi\u0107, D., Jelenkovi\u0107, L., Budin, L.: Genetic programming heuristics for multiple machine scheduling. In: Ebner, M., O\u2019Neill, M., Ek\u00e1rt, A., Vanneschi, L., Esparcia-Alc\u00e1zar, A.I. (eds.) EuroGP 2007. LNCS, vol.\u00a04445, pp. 321\u2013330. Springer, Heidelberg (2007)"},{"key":"55_CR14","unstructured":"Miyashita, K.: Job-shop scheduling with GP. In: GECCO 2000: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 505\u2013512 (2000)"},{"key":"55_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11729976_7","volume-title":"Genetic Programming","author":"D. Jakobovi\u0107","year":"2006","unstructured":"Jakobovi\u0107, D., Budin, L.: Dynamic scheduling with genetic programming. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ek\u00e1rt, A. (eds.) EuroGP 2006. LNCS, vol.\u00a03905, pp. 73\u201384. Springer, Heidelberg (2006)"},{"issue":"5","key":"55_CR16","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TEVC.2012.2227326","volume":"17","author":"S. Nguyen","year":"2013","unstructured":"Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: A computational study of representations in GP to evolve dispatching rules for the job shop scheduling problem. IEEE Transactions on Evolutionary Computation\u00a017(5), 621\u2013639 (2013)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"55_CR17","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","volume":"54","author":"J.C. Tay","year":"2008","unstructured":"Tay, J.C., Ho, N.B.: Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computers & Industrial Engineering\u00a054(3), 453\u2013473 (2008)","journal-title":"Computers & Industrial Engineering"},{"key":"55_CR18","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/002075400189301","volume":"38","author":"M.S. Jayamohan","year":"2000","unstructured":"Jayamohan, M.S., Rajendran, C.: New dispatching rules for shop scheduling: a step forward. International Journal of Production Research\u00a038, 563\u2013586 (2000)","journal-title":"International Journal of Production Research"},{"key":"55_CR19","doi-asserted-by":"crossref","unstructured":"Branke, J., Hildebrandt, T., Scholz-Reiter, B.: Hyper-heuristic evolution of dispatching rules: A comparison of rule representations. Evolutionary Computation (in press, 2014), doi:10.1162\/EVCO_a_00131","DOI":"10.1162\/EVCO_a_00131"},{"key":"55_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<125::AID-JOS40>3.0.CO;2-C","volume":"3","author":"S. Kreipl","year":"2000","unstructured":"Kreipl, S.: A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling\u00a03, 125\u2013138 (2000)","journal-title":"Journal of Scheduling"},{"issue":"1","key":"55_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#","volume":"46","author":"M. Pinedo","year":"1999","unstructured":"Pinedo, M., Singer, M.: A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics\u00a046(1), 1\u201317 (1999)","journal-title":"Naval Research Logistics"},{"issue":"2","key":"55_CR22","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1080\/095372800232379","volume":"11","author":"O. Holthaus","year":"2000","unstructured":"Holthaus, O., Rajendran, C.: Efficient jobshop dispatching rules: Further developments. Production Planning & Control\u00a011(2), 171\u2013178 (2000)","journal-title":"Production Planning & Control"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13563-2_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:54:45Z","timestamp":1747158885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13563-2_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135625","9783319135632"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13563-2_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}